./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix054_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_5b71f6a9-a2f3-4263-8b7f-dc570891d050/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5b71f6a9-a2f3-4263-8b7f-dc570891d050/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5b71f6a9-a2f3-4263-8b7f-dc570891d050/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5b71f6a9-a2f3-4263-8b7f-dc570891d050/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix054_pso.oepc.i -s /tmp/vcloud-vcloud-master/worker/working_dir_5b71f6a9-a2f3-4263-8b7f-dc570891d050/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5b71f6a9-a2f3-4263-8b7f-dc570891d050/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 58444bada42ca918809a5452a60bdce94f4b9342 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:20:56,001 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:20:56,003 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:20:56,012 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:20:56,012 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:20:56,013 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:20:56,014 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:20:56,015 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:20:56,017 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:20:56,017 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:20:56,018 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:20:56,019 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:20:56,019 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:20:56,020 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:20:56,021 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:20:56,022 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:20:56,022 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:20:56,023 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:20:56,024 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:20:56,026 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:20:56,027 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:20:56,027 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:20:56,028 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:20:56,029 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:20:56,031 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:20:56,031 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:20:56,031 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:20:56,032 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:20:56,032 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:20:56,033 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:20:56,033 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:20:56,034 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:20:56,035 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:20:56,035 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:20:56,036 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:20:56,036 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:20:56,041 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:20:56,041 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:20:56,041 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:20:56,042 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:20:56,042 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:20:56,043 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5b71f6a9-a2f3-4263-8b7f-dc570891d050/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:20:56,057 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:20:56,058 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:20:56,058 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:20:56,058 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:20:56,059 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:20:56,059 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:20:56,059 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:20:56,059 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:20:56,059 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:20:56,059 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:20:56,060 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:20:56,060 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:20:56,062 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:20:56,062 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:20:56,063 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:20:56,063 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:20:56,063 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:20:56,063 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:20:56,063 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:20:56,063 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:20:56,064 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:20:56,064 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:20:56,064 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:20:56,064 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:20:56,064 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:20:56,064 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:20:56,065 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:20:56,065 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:20:56,065 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:20:56,065 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:20:56,065 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:20:56,065 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:20:56,066 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:20:56,066 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:20:56,066 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:20:56,066 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_5b71f6a9-a2f3-4263-8b7f-dc570891d050/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 -> 58444bada42ca918809a5452a60bdce94f4b9342 [2019-10-22 11:20:56,106 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:20:56,116 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:20:56,119 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:20:56,121 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:20:56,121 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:20:56,122 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5b71f6a9-a2f3-4263-8b7f-dc570891d050/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix054_pso.oepc.i [2019-10-22 11:20:56,180 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5b71f6a9-a2f3-4263-8b7f-dc570891d050/bin/utaipan/data/e3e0e61c0/c9899eb7882f4746b93d2e6b4e5e71a6/FLAGea952e10c [2019-10-22 11:20:56,649 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:20:56,649 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5b71f6a9-a2f3-4263-8b7f-dc570891d050/sv-benchmarks/c/pthread-wmm/mix054_pso.oepc.i [2019-10-22 11:20:56,667 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5b71f6a9-a2f3-4263-8b7f-dc570891d050/bin/utaipan/data/e3e0e61c0/c9899eb7882f4746b93d2e6b4e5e71a6/FLAGea952e10c [2019-10-22 11:20:57,161 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5b71f6a9-a2f3-4263-8b7f-dc570891d050/bin/utaipan/data/e3e0e61c0/c9899eb7882f4746b93d2e6b4e5e71a6 [2019-10-22 11:20:57,164 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:20:57,165 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:20:57,170 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:20:57,172 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:20:57,175 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:20:57,176 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:20:57" (1/1) ... [2019-10-22 11:20:57,179 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c1ea15e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:57, skipping insertion in model container [2019-10-22 11:20:57,179 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:20:57" (1/1) ... [2019-10-22 11:20:57,190 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:20:57,244 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:20:57,675 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:20:57,689 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:20:57,748 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:20:57,814 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:20:57,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:57 WrapperNode [2019-10-22 11:20:57,814 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:20:57,815 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:20:57,815 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:20:57,815 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:20:57,823 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:20:57" (1/1) ... [2019-10-22 11:20:57,837 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:20:57" (1/1) ... [2019-10-22 11:20:57,862 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:20:57,862 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:20:57,863 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:20:57,863 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:20:57,870 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:57" (1/1) ... [2019-10-22 11:20:57,870 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:57" (1/1) ... [2019-10-22 11:20:57,874 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:57" (1/1) ... [2019-10-22 11:20:57,875 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:57" (1/1) ... [2019-10-22 11:20:57,889 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:57" (1/1) ... [2019-10-22 11:20:57,898 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:57" (1/1) ... [2019-10-22 11:20:57,900 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:57" (1/1) ... [2019-10-22 11:20:57,905 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:20:57,906 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:20:57,906 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:20:57,906 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:20:57,907 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5b71f6a9-a2f3-4263-8b7f-dc570891d050/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:20:57,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 11:20:57,952 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-10-22 11:20:57,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:20:57,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:20:57,953 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-10-22 11:20:57,953 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-10-22 11:20:57,953 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-10-22 11:20:57,953 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-10-22 11:20:57,953 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-10-22 11:20:57,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:20:57,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:20:57,955 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:20:58,531 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:20:58,532 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-22 11:20:58,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:20:58 BoogieIcfgContainer [2019-10-22 11:20:58,534 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:20:58,535 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:20:58,535 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:20:58,538 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:20:58,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:20:57" (1/3) ... [2019-10-22 11:20:58,539 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33539a76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:20:58, skipping insertion in model container [2019-10-22 11:20:58,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:20:57" (2/3) ... [2019-10-22 11:20:58,540 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33539a76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:20:58, skipping insertion in model container [2019-10-22 11:20:58,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:20:58" (3/3) ... [2019-10-22 11:20:58,542 INFO L109 eAbstractionObserver]: Analyzing ICFG mix054_pso.oepc.i [2019-10-22 11:20:58,583 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,584 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,584 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,584 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,584 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,584 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,585 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,586 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,586 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,586 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,587 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,587 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,587 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,587 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,587 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,587 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,587 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,588 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,588 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,588 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,588 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,589 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,589 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,589 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,589 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,589 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,589 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,589 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,590 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,590 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,590 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,590 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,590 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,590 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,590 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,591 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,591 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,591 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,591 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,592 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,592 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,592 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,592 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,592 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,592 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,594 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,595 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,595 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,595 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,595 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,595 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,599 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,600 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,600 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,600 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,600 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,600 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,600 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,600 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,601 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,601 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,601 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,601 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,601 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,601 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,602 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,602 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,602 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,602 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,602 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,602 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,602 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,602 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,603 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,603 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,603 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,603 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,603 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,603 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,603 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,604 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,604 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,604 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,604 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,604 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,604 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,606 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,606 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,606 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,606 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,606 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,607 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,607 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,607 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,607 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,607 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,607 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,607 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,608 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,608 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,608 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,608 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,608 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,608 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,609 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,609 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,609 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,609 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,609 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,609 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,609 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,610 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,610 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,610 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,610 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,610 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,610 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,611 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,611 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,611 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,611 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,611 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,611 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,611 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,612 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,612 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,612 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,612 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,615 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,615 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,616 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,616 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,617 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,617 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,617 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,617 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,617 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,617 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,618 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,618 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,618 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,618 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,618 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,618 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,619 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,619 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,619 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,620 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,620 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,620 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,620 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,620 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,620 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,620 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,621 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,621 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,621 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,621 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,621 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,621 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,621 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,621 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,622 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,622 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 11:20:58,627 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-10-22 11:20:58,627 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:20:58,638 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-10-22 11:20:58,646 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-10-22 11:20:58,660 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:20:58,660 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:20:58,660 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:20:58,660 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:20:58,660 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:20:58,661 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:20:58,661 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:20:58,661 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:20:58,671 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 141 places, 179 transitions [2019-10-22 11:21:01,841 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34805 states. [2019-10-22 11:21:01,842 INFO L276 IsEmpty]: Start isEmpty. Operand 34805 states. [2019-10-22 11:21:01,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-22 11:21:01,850 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:01,850 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] [2019-10-22 11:21:01,852 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:01,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:01,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1417398579, now seen corresponding path program 1 times [2019-10-22 11:21:01,866 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:01,866 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556256594] [2019-10-22 11:21:01,866 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:01,866 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:01,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:01,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:02,097 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:21:02,097 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556256594] [2019-10-22 11:21:02,098 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:02,098 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:21:02,098 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646911683] [2019-10-22 11:21:02,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:21:02,104 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:02,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:21:02,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:02,120 INFO L87 Difference]: Start difference. First operand 34805 states. Second operand 4 states. [2019-10-22 11:21:02,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:02,867 INFO L93 Difference]: Finished difference Result 35833 states and 137562 transitions. [2019-10-22 11:21:02,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:21:02,869 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-10-22 11:21:02,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:03,088 INFO L225 Difference]: With dead ends: 35833 [2019-10-22 11:21:03,090 INFO L226 Difference]: Without dead ends: 27337 [2019-10-22 11:21:03,091 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:21:03,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27337 states. [2019-10-22 11:21:04,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27337 to 27337. [2019-10-22 11:21:04,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27337 states. [2019-10-22 11:21:04,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27337 states to 27337 states and 105498 transitions. [2019-10-22 11:21:04,372 INFO L78 Accepts]: Start accepts. Automaton has 27337 states and 105498 transitions. Word has length 32 [2019-10-22 11:21:04,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:04,372 INFO L462 AbstractCegarLoop]: Abstraction has 27337 states and 105498 transitions. [2019-10-22 11:21:04,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:21:04,372 INFO L276 IsEmpty]: Start isEmpty. Operand 27337 states and 105498 transitions. [2019-10-22 11:21:04,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-22 11:21:04,385 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:04,386 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] [2019-10-22 11:21:04,386 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:04,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:04,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1163149579, now seen corresponding path program 1 times [2019-10-22 11:21:04,387 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:04,387 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423295094] [2019-10-22 11:21:04,387 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:04,387 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:04,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:04,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:04,511 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:21:04,512 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423295094] [2019-10-22 11:21:04,512 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:04,512 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:21:04,512 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125109124] [2019-10-22 11:21:04,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:21:04,518 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:04,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:21:04,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:21:04,519 INFO L87 Difference]: Start difference. First operand 27337 states and 105498 transitions. Second operand 5 states. [2019-10-22 11:21:05,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:05,284 INFO L93 Difference]: Finished difference Result 43807 states and 159850 transitions. [2019-10-22 11:21:05,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:21:05,285 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-10-22 11:21:05,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:05,447 INFO L225 Difference]: With dead ends: 43807 [2019-10-22 11:21:05,447 INFO L226 Difference]: Without dead ends: 43255 [2019-10-22 11:21:05,448 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:21:06,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43255 states. [2019-10-22 11:21:06,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43255 to 41419. [2019-10-22 11:21:06,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41419 states. [2019-10-22 11:21:06,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41419 states to 41419 states and 152328 transitions. [2019-10-22 11:21:06,878 INFO L78 Accepts]: Start accepts. Automaton has 41419 states and 152328 transitions. Word has length 44 [2019-10-22 11:21:06,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:06,879 INFO L462 AbstractCegarLoop]: Abstraction has 41419 states and 152328 transitions. [2019-10-22 11:21:06,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:21:06,879 INFO L276 IsEmpty]: Start isEmpty. Operand 41419 states and 152328 transitions. [2019-10-22 11:21:06,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-22 11:21:06,883 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:06,884 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:06,884 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:06,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:06,884 INFO L82 PathProgramCache]: Analyzing trace with hash 605576156, now seen corresponding path program 1 times [2019-10-22 11:21:06,884 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:06,885 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556416112] [2019-10-22 11:21:06,885 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:06,885 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:06,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:06,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:06,965 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:21:06,965 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556416112] [2019-10-22 11:21:06,965 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:06,965 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:21:06,965 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90172427] [2019-10-22 11:21:06,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:21:06,966 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:06,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:21:06,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:21:06,967 INFO L87 Difference]: Start difference. First operand 41419 states and 152328 transitions. Second operand 5 states. [2019-10-22 11:21:08,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:08,098 INFO L93 Difference]: Finished difference Result 52769 states and 191023 transitions. [2019-10-22 11:21:08,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:21:08,098 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-10-22 11:21:08,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:08,274 INFO L225 Difference]: With dead ends: 52769 [2019-10-22 11:21:08,274 INFO L226 Difference]: Without dead ends: 52257 [2019-10-22 11:21:08,275 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:21:08,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52257 states. [2019-10-22 11:21:09,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52257 to 45373. [2019-10-22 11:21:09,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45373 states. [2019-10-22 11:21:09,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45373 states to 45373 states and 166016 transitions. [2019-10-22 11:21:09,357 INFO L78 Accepts]: Start accepts. Automaton has 45373 states and 166016 transitions. Word has length 45 [2019-10-22 11:21:09,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:09,358 INFO L462 AbstractCegarLoop]: Abstraction has 45373 states and 166016 transitions. [2019-10-22 11:21:09,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:21:09,358 INFO L276 IsEmpty]: Start isEmpty. Operand 45373 states and 166016 transitions. [2019-10-22 11:21:09,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-22 11:21:09,365 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:09,365 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:21:09,365 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:09,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:09,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1184682590, now seen corresponding path program 1 times [2019-10-22 11:21:09,366 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:09,366 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181438126] [2019-10-22 11:21:09,366 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:09,366 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:09,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:09,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:09,412 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:21:09,413 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181438126] [2019-10-22 11:21:09,413 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:09,413 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:21:09,413 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242607782] [2019-10-22 11:21:09,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:09,414 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:09,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:09,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:09,414 INFO L87 Difference]: Start difference. First operand 45373 states and 166016 transitions. Second operand 3 states. [2019-10-22 11:21:10,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:10,292 INFO L93 Difference]: Finished difference Result 65249 states and 235812 transitions. [2019-10-22 11:21:10,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:10,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-10-22 11:21:10,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:10,444 INFO L225 Difference]: With dead ends: 65249 [2019-10-22 11:21:10,445 INFO L226 Difference]: Without dead ends: 65249 [2019-10-22 11:21:10,445 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:21:10,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65249 states. [2019-10-22 11:21:11,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65249 to 50943. [2019-10-22 11:21:11,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50943 states. [2019-10-22 11:21:11,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50943 states to 50943 states and 184323 transitions. [2019-10-22 11:21:11,526 INFO L78 Accepts]: Start accepts. Automaton has 50943 states and 184323 transitions. Word has length 47 [2019-10-22 11:21:11,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:11,526 INFO L462 AbstractCegarLoop]: Abstraction has 50943 states and 184323 transitions. [2019-10-22 11:21:11,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:11,526 INFO L276 IsEmpty]: Start isEmpty. Operand 50943 states and 184323 transitions. [2019-10-22 11:21:11,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-22 11:21:11,541 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:11,541 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] [2019-10-22 11:21:11,541 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:11,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:11,542 INFO L82 PathProgramCache]: Analyzing trace with hash 388757837, now seen corresponding path program 1 times [2019-10-22 11:21:11,542 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:11,542 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429155875] [2019-10-22 11:21:11,542 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:11,542 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:11,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:11,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:11,688 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:21:11,688 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429155875] [2019-10-22 11:21:11,688 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:11,694 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:21:11,694 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784611000] [2019-10-22 11:21:11,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:21:11,695 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:11,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:21:11,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:21:11,696 INFO L87 Difference]: Start difference. First operand 50943 states and 184323 transitions. Second operand 6 states. [2019-10-22 11:21:12,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:12,662 INFO L93 Difference]: Finished difference Result 67509 states and 242183 transitions. [2019-10-22 11:21:12,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:21:12,663 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-10-22 11:21:12,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:13,460 INFO L225 Difference]: With dead ends: 67509 [2019-10-22 11:21:13,460 INFO L226 Difference]: Without dead ends: 67509 [2019-10-22 11:21:13,461 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:21:13,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67509 states. [2019-10-22 11:21:14,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67509 to 63434. [2019-10-22 11:21:14,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63434 states. [2019-10-22 11:21:14,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63434 states to 63434 states and 227582 transitions. [2019-10-22 11:21:14,693 INFO L78 Accepts]: Start accepts. Automaton has 63434 states and 227582 transitions. Word has length 51 [2019-10-22 11:21:14,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:14,694 INFO L462 AbstractCegarLoop]: Abstraction has 63434 states and 227582 transitions. [2019-10-22 11:21:14,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:21:14,694 INFO L276 IsEmpty]: Start isEmpty. Operand 63434 states and 227582 transitions. [2019-10-22 11:21:14,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-22 11:21:14,709 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:14,709 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] [2019-10-22 11:21:14,709 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:14,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:14,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1408193522, now seen corresponding path program 1 times [2019-10-22 11:21:14,710 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:14,710 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321874007] [2019-10-22 11:21:14,710 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:14,710 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:14,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:14,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:14,825 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:21:14,826 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321874007] [2019-10-22 11:21:14,827 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:14,828 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:21:14,828 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617671725] [2019-10-22 11:21:14,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:21:14,829 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:14,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:21:14,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:21:14,829 INFO L87 Difference]: Start difference. First operand 63434 states and 227582 transitions. Second operand 5 states. [2019-10-22 11:21:14,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:14,935 INFO L93 Difference]: Finished difference Result 15373 states and 48824 transitions. [2019-10-22 11:21:14,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:21:14,936 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-10-22 11:21:14,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:14,966 INFO L225 Difference]: With dead ends: 15373 [2019-10-22 11:21:14,967 INFO L226 Difference]: Without dead ends: 13787 [2019-10-22 11:21:14,967 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:21:15,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13787 states. [2019-10-22 11:21:15,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13787 to 13738. [2019-10-22 11:21:15,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13738 states. [2019-10-22 11:21:15,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13738 states to 13738 states and 43350 transitions. [2019-10-22 11:21:15,207 INFO L78 Accepts]: Start accepts. Automaton has 13738 states and 43350 transitions. Word has length 51 [2019-10-22 11:21:15,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:15,207 INFO L462 AbstractCegarLoop]: Abstraction has 13738 states and 43350 transitions. [2019-10-22 11:21:15,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:21:15,207 INFO L276 IsEmpty]: Start isEmpty. Operand 13738 states and 43350 transitions. [2019-10-22 11:21:15,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-22 11:21:15,209 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:15,210 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] [2019-10-22 11:21:15,210 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:15,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:15,210 INFO L82 PathProgramCache]: Analyzing trace with hash 2094486829, now seen corresponding path program 1 times [2019-10-22 11:21:15,211 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:15,211 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119586636] [2019-10-22 11:21:15,211 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:15,211 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:15,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:15,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:15,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:15,293 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119586636] [2019-10-22 11:21:15,293 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:15,293 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:21:15,293 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996756779] [2019-10-22 11:21:15,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:21:15,294 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:15,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:21:15,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:21:15,294 INFO L87 Difference]: Start difference. First operand 13738 states and 43350 transitions. Second operand 6 states. [2019-10-22 11:21:15,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:15,695 INFO L93 Difference]: Finished difference Result 17066 states and 53146 transitions. [2019-10-22 11:21:15,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 11:21:15,695 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-10-22 11:21:15,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:15,728 INFO L225 Difference]: With dead ends: 17066 [2019-10-22 11:21:15,729 INFO L226 Difference]: Without dead ends: 16994 [2019-10-22 11:21:15,729 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-10-22 11:21:15,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16994 states. [2019-10-22 11:21:16,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16994 to 14312. [2019-10-22 11:21:16,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14312 states. [2019-10-22 11:21:16,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14312 states to 14312 states and 45047 transitions. [2019-10-22 11:21:16,097 INFO L78 Accepts]: Start accepts. Automaton has 14312 states and 45047 transitions. Word has length 51 [2019-10-22 11:21:16,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:16,098 INFO L462 AbstractCegarLoop]: Abstraction has 14312 states and 45047 transitions. [2019-10-22 11:21:16,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:21:16,098 INFO L276 IsEmpty]: Start isEmpty. Operand 14312 states and 45047 transitions. [2019-10-22 11:21:16,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-22 11:21:16,101 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:16,101 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] [2019-10-22 11:21:16,102 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:16,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:16,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1957998967, now seen corresponding path program 1 times [2019-10-22 11:21:16,102 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:16,102 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269653816] [2019-10-22 11:21:16,102 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:16,102 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:16,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:16,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:16,145 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:21:16,145 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269653816] [2019-10-22 11:21:16,145 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:16,145 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:21:16,145 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862914268] [2019-10-22 11:21:16,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:21:16,146 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:16,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:21:16,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:16,146 INFO L87 Difference]: Start difference. First operand 14312 states and 45047 transitions. Second operand 4 states. [2019-10-22 11:21:16,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:16,284 INFO L93 Difference]: Finished difference Result 16615 states and 52375 transitions. [2019-10-22 11:21:16,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:21:16,284 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-10-22 11:21:16,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:16,313 INFO L225 Difference]: With dead ends: 16615 [2019-10-22 11:21:16,313 INFO L226 Difference]: Without dead ends: 16615 [2019-10-22 11:21:16,314 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:21:16,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16615 states. [2019-10-22 11:21:16,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16615 to 15132. [2019-10-22 11:21:16,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15132 states. [2019-10-22 11:21:16,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15132 states to 15132 states and 47637 transitions. [2019-10-22 11:21:16,518 INFO L78 Accepts]: Start accepts. Automaton has 15132 states and 47637 transitions. Word has length 59 [2019-10-22 11:21:16,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:16,518 INFO L462 AbstractCegarLoop]: Abstraction has 15132 states and 47637 transitions. [2019-10-22 11:21:16,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:21:16,518 INFO L276 IsEmpty]: Start isEmpty. Operand 15132 states and 47637 transitions. [2019-10-22 11:21:16,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-22 11:21:16,522 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:16,522 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] [2019-10-22 11:21:16,522 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:16,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:16,523 INFO L82 PathProgramCache]: Analyzing trace with hash -215188632, now seen corresponding path program 1 times [2019-10-22 11:21:16,523 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:16,523 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551621846] [2019-10-22 11:21:16,523 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:16,523 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:16,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:16,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:16,603 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:21:16,603 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551621846] [2019-10-22 11:21:16,603 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:16,603 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:21:16,603 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164160129] [2019-10-22 11:21:16,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:21:16,604 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:16,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:21:16,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:21:16,604 INFO L87 Difference]: Start difference. First operand 15132 states and 47637 transitions. Second operand 6 states. [2019-10-22 11:21:16,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:16,965 INFO L93 Difference]: Finished difference Result 18450 states and 57254 transitions. [2019-10-22 11:21:16,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 11:21:16,966 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-10-22 11:21:16,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:16,992 INFO L225 Difference]: With dead ends: 18450 [2019-10-22 11:21:16,992 INFO L226 Difference]: Without dead ends: 18379 [2019-10-22 11:21:16,992 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:21:17,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18379 states. [2019-10-22 11:21:17,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18379 to 17410. [2019-10-22 11:21:17,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17410 states. [2019-10-22 11:21:17,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17410 states to 17410 states and 54311 transitions. [2019-10-22 11:21:17,236 INFO L78 Accepts]: Start accepts. Automaton has 17410 states and 54311 transitions. Word has length 59 [2019-10-22 11:21:17,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:17,237 INFO L462 AbstractCegarLoop]: Abstraction has 17410 states and 54311 transitions. [2019-10-22 11:21:17,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:21:17,237 INFO L276 IsEmpty]: Start isEmpty. Operand 17410 states and 54311 transitions. [2019-10-22 11:21:17,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-22 11:21:17,243 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:17,243 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] [2019-10-22 11:21:17,243 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:17,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:17,243 INFO L82 PathProgramCache]: Analyzing trace with hash 424326332, now seen corresponding path program 1 times [2019-10-22 11:21:17,243 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:17,244 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502774734] [2019-10-22 11:21:17,244 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:17,244 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:17,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:17,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:17,292 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:21:17,292 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502774734] [2019-10-22 11:21:17,292 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:17,293 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:21:17,293 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990856734] [2019-10-22 11:21:17,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:21:17,294 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:17,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:21:17,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:17,294 INFO L87 Difference]: Start difference. First operand 17410 states and 54311 transitions. Second operand 4 states. [2019-10-22 11:21:17,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:17,726 INFO L93 Difference]: Finished difference Result 24408 states and 74495 transitions. [2019-10-22 11:21:17,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:21:17,726 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-10-22 11:21:17,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:17,760 INFO L225 Difference]: With dead ends: 24408 [2019-10-22 11:21:17,760 INFO L226 Difference]: Without dead ends: 24336 [2019-10-22 11:21:17,760 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:21:17,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24336 states. [2019-10-22 11:21:18,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24336 to 19176. [2019-10-22 11:21:18,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19176 states. [2019-10-22 11:21:18,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19176 states to 19176 states and 59215 transitions. [2019-10-22 11:21:18,040 INFO L78 Accepts]: Start accepts. Automaton has 19176 states and 59215 transitions. Word has length 63 [2019-10-22 11:21:18,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:18,040 INFO L462 AbstractCegarLoop]: Abstraction has 19176 states and 59215 transitions. [2019-10-22 11:21:18,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:21:18,040 INFO L276 IsEmpty]: Start isEmpty. Operand 19176 states and 59215 transitions. [2019-10-22 11:21:18,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-22 11:21:18,048 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:18,048 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] [2019-10-22 11:21:18,048 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:18,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:18,048 INFO L82 PathProgramCache]: Analyzing trace with hash -820438149, now seen corresponding path program 1 times [2019-10-22 11:21:18,048 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:18,049 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243582186] [2019-10-22 11:21:18,049 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:18,049 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:18,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:18,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:18,103 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:21:18,103 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243582186] [2019-10-22 11:21:18,103 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:18,103 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:21:18,103 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047657912] [2019-10-22 11:21:18,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:21:18,104 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:18,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:21:18,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:18,104 INFO L87 Difference]: Start difference. First operand 19176 states and 59215 transitions. Second operand 4 states. [2019-10-22 11:21:18,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:18,400 INFO L93 Difference]: Finished difference Result 23415 states and 71445 transitions. [2019-10-22 11:21:18,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:21:18,401 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-10-22 11:21:18,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:18,434 INFO L225 Difference]: With dead ends: 23415 [2019-10-22 11:21:18,434 INFO L226 Difference]: Without dead ends: 23415 [2019-10-22 11:21:18,435 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:21:18,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23415 states. [2019-10-22 11:21:18,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23415 to 19450. [2019-10-22 11:21:18,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19450 states. [2019-10-22 11:21:18,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19450 states to 19450 states and 59973 transitions. [2019-10-22 11:21:18,732 INFO L78 Accepts]: Start accepts. Automaton has 19450 states and 59973 transitions. Word has length 63 [2019-10-22 11:21:18,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:18,732 INFO L462 AbstractCegarLoop]: Abstraction has 19450 states and 59973 transitions. [2019-10-22 11:21:18,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:21:18,732 INFO L276 IsEmpty]: Start isEmpty. Operand 19450 states and 59973 transitions. [2019-10-22 11:21:18,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-22 11:21:18,740 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:18,740 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] [2019-10-22 11:21:18,740 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:18,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:18,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1397319804, now seen corresponding path program 1 times [2019-10-22 11:21:18,740 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:18,740 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086102570] [2019-10-22 11:21:18,741 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:18,741 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:18,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:18,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:18,805 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:21:18,805 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086102570] [2019-10-22 11:21:18,805 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:18,806 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:21:18,806 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573456806] [2019-10-22 11:21:18,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:18,806 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:18,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:18,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:18,807 INFO L87 Difference]: Start difference. First operand 19450 states and 59973 transitions. Second operand 3 states. [2019-10-22 11:21:19,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:19,024 INFO L93 Difference]: Finished difference Result 19970 states and 61393 transitions. [2019-10-22 11:21:19,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:19,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-10-22 11:21:19,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:19,052 INFO L225 Difference]: With dead ends: 19970 [2019-10-22 11:21:19,052 INFO L226 Difference]: Without dead ends: 19970 [2019-10-22 11:21:19,052 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:21:19,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19970 states. [2019-10-22 11:21:19,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19970 to 19710. [2019-10-22 11:21:19,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19710 states. [2019-10-22 11:21:19,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19710 states to 19710 states and 60663 transitions. [2019-10-22 11:21:19,334 INFO L78 Accepts]: Start accepts. Automaton has 19710 states and 60663 transitions. Word has length 63 [2019-10-22 11:21:19,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:19,335 INFO L462 AbstractCegarLoop]: Abstraction has 19710 states and 60663 transitions. [2019-10-22 11:21:19,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:19,335 INFO L276 IsEmpty]: Start isEmpty. Operand 19710 states and 60663 transitions. [2019-10-22 11:21:19,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-22 11:21:19,344 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:19,345 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] [2019-10-22 11:21:19,345 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:19,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:19,345 INFO L82 PathProgramCache]: Analyzing trace with hash 376411073, now seen corresponding path program 1 times [2019-10-22 11:21:19,345 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:19,345 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147870850] [2019-10-22 11:21:19,345 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:19,345 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:19,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:19,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:19,433 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:21:19,433 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147870850] [2019-10-22 11:21:19,433 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:19,433 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:21:19,433 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363519110] [2019-10-22 11:21:19,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:21:19,434 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:19,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:21:19,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:21:19,434 INFO L87 Difference]: Start difference. First operand 19710 states and 60663 transitions. Second operand 6 states. [2019-10-22 11:21:19,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:19,746 INFO L93 Difference]: Finished difference Result 21322 states and 64528 transitions. [2019-10-22 11:21:19,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 11:21:19,747 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-10-22 11:21:19,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:19,772 INFO L225 Difference]: With dead ends: 21322 [2019-10-22 11:21:19,772 INFO L226 Difference]: Without dead ends: 21322 [2019-10-22 11:21:19,773 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:21:19,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21322 states. [2019-10-22 11:21:20,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21322 to 19934. [2019-10-22 11:21:20,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19934 states. [2019-10-22 11:21:20,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19934 states to 19934 states and 60933 transitions. [2019-10-22 11:21:20,126 INFO L78 Accepts]: Start accepts. Automaton has 19934 states and 60933 transitions. Word has length 65 [2019-10-22 11:21:20,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:20,126 INFO L462 AbstractCegarLoop]: Abstraction has 19934 states and 60933 transitions. [2019-10-22 11:21:20,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:21:20,127 INFO L276 IsEmpty]: Start isEmpty. Operand 19934 states and 60933 transitions. [2019-10-22 11:21:20,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-22 11:21:20,135 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:20,135 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] [2019-10-22 11:21:20,135 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:20,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:20,135 INFO L82 PathProgramCache]: Analyzing trace with hash 587761986, now seen corresponding path program 1 times [2019-10-22 11:21:20,135 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:20,136 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667317851] [2019-10-22 11:21:20,136 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:20,136 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:20,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:20,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:20,204 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:21:20,204 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667317851] [2019-10-22 11:21:20,204 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:20,205 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:21:20,205 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654616792] [2019-10-22 11:21:20,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:21:20,205 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:20,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:21:20,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:21:20,206 INFO L87 Difference]: Start difference. First operand 19934 states and 60933 transitions. Second operand 5 states. [2019-10-22 11:21:20,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:20,559 INFO L93 Difference]: Finished difference Result 25454 states and 77367 transitions. [2019-10-22 11:21:20,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:21:20,560 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-10-22 11:21:20,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:20,599 INFO L225 Difference]: With dead ends: 25454 [2019-10-22 11:21:20,599 INFO L226 Difference]: Without dead ends: 25454 [2019-10-22 11:21:20,599 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:21:20,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25454 states. [2019-10-22 11:21:20,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25454 to 23338. [2019-10-22 11:21:20,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23338 states. [2019-10-22 11:21:20,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23338 states to 23338 states and 70904 transitions. [2019-10-22 11:21:20,919 INFO L78 Accepts]: Start accepts. Automaton has 23338 states and 70904 transitions. Word has length 65 [2019-10-22 11:21:20,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:20,920 INFO L462 AbstractCegarLoop]: Abstraction has 23338 states and 70904 transitions. [2019-10-22 11:21:20,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:21:20,920 INFO L276 IsEmpty]: Start isEmpty. Operand 23338 states and 70904 transitions. [2019-10-22 11:21:20,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-22 11:21:20,929 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:20,929 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] [2019-10-22 11:21:20,929 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:20,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:20,930 INFO L82 PathProgramCache]: Analyzing trace with hash 77227809, now seen corresponding path program 1 times [2019-10-22 11:21:20,930 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:20,930 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491785482] [2019-10-22 11:21:20,930 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:20,930 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:20,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:20,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:21,010 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:21:21,011 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491785482] [2019-10-22 11:21:21,011 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:21,011 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:21:21,011 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382027264] [2019-10-22 11:21:21,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:21:21,011 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:21,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:21:21,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:21:21,012 INFO L87 Difference]: Start difference. First operand 23338 states and 70904 transitions. Second operand 5 states. [2019-10-22 11:21:21,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:21,372 INFO L93 Difference]: Finished difference Result 34432 states and 103272 transitions. [2019-10-22 11:21:21,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:21:21,372 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-10-22 11:21:21,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:21,417 INFO L225 Difference]: With dead ends: 34432 [2019-10-22 11:21:21,417 INFO L226 Difference]: Without dead ends: 34432 [2019-10-22 11:21:21,418 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:21:21,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34432 states. [2019-10-22 11:21:21,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34432 to 27780. [2019-10-22 11:21:21,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27780 states. [2019-10-22 11:21:21,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27780 states to 27780 states and 83467 transitions. [2019-10-22 11:21:21,804 INFO L78 Accepts]: Start accepts. Automaton has 27780 states and 83467 transitions. Word has length 65 [2019-10-22 11:21:21,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:21,804 INFO L462 AbstractCegarLoop]: Abstraction has 27780 states and 83467 transitions. [2019-10-22 11:21:21,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:21:21,804 INFO L276 IsEmpty]: Start isEmpty. Operand 27780 states and 83467 transitions. [2019-10-22 11:21:21,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-22 11:21:21,815 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:21,815 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] [2019-10-22 11:21:21,815 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:21,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:21,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1730226654, now seen corresponding path program 1 times [2019-10-22 11:21:21,816 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:21,816 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350093694] [2019-10-22 11:21:21,816 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:21,816 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:21,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:21,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:21,869 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:21:21,869 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350093694] [2019-10-22 11:21:21,869 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:21,870 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:21:21,870 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844754665] [2019-10-22 11:21:21,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:21:21,870 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:21,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:21:21,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:21,871 INFO L87 Difference]: Start difference. First operand 27780 states and 83467 transitions. Second operand 4 states. [2019-10-22 11:21:22,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:22,314 INFO L93 Difference]: Finished difference Result 36580 states and 110203 transitions. [2019-10-22 11:21:22,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:21:22,315 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-10-22 11:21:22,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:22,367 INFO L225 Difference]: With dead ends: 36580 [2019-10-22 11:21:22,367 INFO L226 Difference]: Without dead ends: 36388 [2019-10-22 11:21:22,368 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:21:22,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36388 states. [2019-10-22 11:21:22,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36388 to 33740. [2019-10-22 11:21:22,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33740 states. [2019-10-22 11:21:22,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33740 states to 33740 states and 101713 transitions. [2019-10-22 11:21:22,833 INFO L78 Accepts]: Start accepts. Automaton has 33740 states and 101713 transitions. Word has length 65 [2019-10-22 11:21:22,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:22,834 INFO L462 AbstractCegarLoop]: Abstraction has 33740 states and 101713 transitions. [2019-10-22 11:21:22,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:21:22,834 INFO L276 IsEmpty]: Start isEmpty. Operand 33740 states and 101713 transitions. [2019-10-22 11:21:22,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-22 11:21:22,844 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:22,844 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] [2019-10-22 11:21:22,845 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:22,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:22,845 INFO L82 PathProgramCache]: Analyzing trace with hash 767789283, now seen corresponding path program 1 times [2019-10-22 11:21:22,845 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:22,845 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064097769] [2019-10-22 11:21:22,845 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:22,845 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:22,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:22,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:22,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:21:22,922 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064097769] [2019-10-22 11:21:22,922 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:22,923 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:21:22,923 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044455379] [2019-10-22 11:21:22,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:21:22,923 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:22,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:21:22,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:21:22,924 INFO L87 Difference]: Start difference. First operand 33740 states and 101713 transitions. Second operand 5 states. [2019-10-22 11:21:22,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:22,984 INFO L93 Difference]: Finished difference Result 8356 states and 20403 transitions. [2019-10-22 11:21:22,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:21:22,984 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-10-22 11:21:22,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:22,993 INFO L225 Difference]: With dead ends: 8356 [2019-10-22 11:21:22,993 INFO L226 Difference]: Without dead ends: 6588 [2019-10-22 11:21:22,993 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:21:23,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6588 states. [2019-10-22 11:21:23,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6588 to 5161. [2019-10-22 11:21:23,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5161 states. [2019-10-22 11:21:23,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5161 states to 5161 states and 12358 transitions. [2019-10-22 11:21:23,076 INFO L78 Accepts]: Start accepts. Automaton has 5161 states and 12358 transitions. Word has length 65 [2019-10-22 11:21:23,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:23,077 INFO L462 AbstractCegarLoop]: Abstraction has 5161 states and 12358 transitions. [2019-10-22 11:21:23,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:21:23,077 INFO L276 IsEmpty]: Start isEmpty. Operand 5161 states and 12358 transitions. [2019-10-22 11:21:23,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-22 11:21:23,081 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:23,081 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] [2019-10-22 11:21:23,081 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:23,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:23,082 INFO L82 PathProgramCache]: Analyzing trace with hash 3166969, now seen corresponding path program 1 times [2019-10-22 11:21:23,082 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:23,082 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954645342] [2019-10-22 11:21:23,082 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:23,082 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:23,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:23,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:23,120 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:21:23,120 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954645342] [2019-10-22 11:21:23,120 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:23,120 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:21:23,120 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351374978] [2019-10-22 11:21:23,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:23,121 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:23,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:23,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:23,121 INFO L87 Difference]: Start difference. First operand 5161 states and 12358 transitions. Second operand 3 states. [2019-10-22 11:21:23,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:23,160 INFO L93 Difference]: Finished difference Result 7236 states and 17318 transitions. [2019-10-22 11:21:23,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:23,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-10-22 11:21:23,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:23,168 INFO L225 Difference]: With dead ends: 7236 [2019-10-22 11:21:23,169 INFO L226 Difference]: Without dead ends: 7236 [2019-10-22 11:21:23,169 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:23,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7236 states. [2019-10-22 11:21:23,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7236 to 5104. [2019-10-22 11:21:23,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5104 states. [2019-10-22 11:21:23,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5104 states to 5104 states and 11991 transitions. [2019-10-22 11:21:23,248 INFO L78 Accepts]: Start accepts. Automaton has 5104 states and 11991 transitions. Word has length 65 [2019-10-22 11:21:23,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:23,248 INFO L462 AbstractCegarLoop]: Abstraction has 5104 states and 11991 transitions. [2019-10-22 11:21:23,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:23,248 INFO L276 IsEmpty]: Start isEmpty. Operand 5104 states and 11991 transitions. [2019-10-22 11:21:23,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-22 11:21:23,253 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:23,253 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:23,253 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:23,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:23,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1155493780, now seen corresponding path program 1 times [2019-10-22 11:21:23,254 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:23,254 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896149258] [2019-10-22 11:21:23,254 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:23,254 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:23,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:23,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:23,331 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:21:23,331 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896149258] [2019-10-22 11:21:23,332 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:23,332 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:21:23,332 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544681057] [2019-10-22 11:21:23,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:21:23,333 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:23,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:21:23,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:21:23,334 INFO L87 Difference]: Start difference. First operand 5104 states and 11991 transitions. Second operand 5 states. [2019-10-22 11:21:23,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:23,502 INFO L93 Difference]: Finished difference Result 6127 states and 14344 transitions. [2019-10-22 11:21:23,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 11:21:23,502 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-10-22 11:21:23,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:23,509 INFO L225 Difference]: With dead ends: 6127 [2019-10-22 11:21:23,509 INFO L226 Difference]: Without dead ends: 6127 [2019-10-22 11:21:23,510 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:21:23,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6127 states. [2019-10-22 11:21:23,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6127 to 5496. [2019-10-22 11:21:23,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5496 states. [2019-10-22 11:21:23,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5496 states to 5496 states and 12892 transitions. [2019-10-22 11:21:23,564 INFO L78 Accepts]: Start accepts. Automaton has 5496 states and 12892 transitions. Word has length 71 [2019-10-22 11:21:23,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:23,564 INFO L462 AbstractCegarLoop]: Abstraction has 5496 states and 12892 transitions. [2019-10-22 11:21:23,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:21:23,564 INFO L276 IsEmpty]: Start isEmpty. Operand 5496 states and 12892 transitions. [2019-10-22 11:21:23,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-22 11:21:23,568 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:23,568 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] [2019-10-22 11:21:23,568 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:23,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:23,569 INFO L82 PathProgramCache]: Analyzing trace with hash 587316555, now seen corresponding path program 1 times [2019-10-22 11:21:23,569 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:23,569 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112820164] [2019-10-22 11:21:23,569 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:23,569 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:23,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:23,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:23,639 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:21:23,639 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112820164] [2019-10-22 11:21:23,640 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:23,640 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 11:21:23,640 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213174274] [2019-10-22 11:21:23,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 11:21:23,641 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:23,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 11:21:23,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:21:23,641 INFO L87 Difference]: Start difference. First operand 5496 states and 12892 transitions. Second operand 7 states. [2019-10-22 11:21:24,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:24,056 INFO L93 Difference]: Finished difference Result 6682 states and 15558 transitions. [2019-10-22 11:21:24,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-22 11:21:24,056 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2019-10-22 11:21:24,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:24,061 INFO L225 Difference]: With dead ends: 6682 [2019-10-22 11:21:24,061 INFO L226 Difference]: Without dead ends: 6627 [2019-10-22 11:21:24,061 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-10-22 11:21:24,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6627 states. [2019-10-22 11:21:24,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6627 to 5564. [2019-10-22 11:21:24,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5564 states. [2019-10-22 11:21:24,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5564 states to 5564 states and 12958 transitions. [2019-10-22 11:21:24,116 INFO L78 Accepts]: Start accepts. Automaton has 5564 states and 12958 transitions. Word has length 71 [2019-10-22 11:21:24,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:24,117 INFO L462 AbstractCegarLoop]: Abstraction has 5564 states and 12958 transitions. [2019-10-22 11:21:24,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 11:21:24,117 INFO L276 IsEmpty]: Start isEmpty. Operand 5564 states and 12958 transitions. [2019-10-22 11:21:24,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-22 11:21:24,123 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:24,124 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:24,124 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:24,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:24,124 INFO L82 PathProgramCache]: Analyzing trace with hash -323530346, now seen corresponding path program 1 times [2019-10-22 11:21:24,125 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:24,125 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710242082] [2019-10-22 11:21:24,125 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:24,125 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:24,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:24,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:24,171 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:21:24,171 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710242082] [2019-10-22 11:21:24,172 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:24,172 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:21:24,172 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723666896] [2019-10-22 11:21:24,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:24,172 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:24,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:24,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:24,173 INFO L87 Difference]: Start difference. First operand 5564 states and 12958 transitions. Second operand 3 states. [2019-10-22 11:21:24,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:24,333 INFO L93 Difference]: Finished difference Result 7293 states and 16480 transitions. [2019-10-22 11:21:24,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:24,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-10-22 11:21:24,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:24,339 INFO L225 Difference]: With dead ends: 7293 [2019-10-22 11:21:24,339 INFO L226 Difference]: Without dead ends: 6965 [2019-10-22 11:21:24,339 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:21:24,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6965 states. [2019-10-22 11:21:24,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6965 to 6435. [2019-10-22 11:21:24,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6435 states. [2019-10-22 11:21:24,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6435 states to 6435 states and 14760 transitions. [2019-10-22 11:21:24,403 INFO L78 Accepts]: Start accepts. Automaton has 6435 states and 14760 transitions. Word has length 90 [2019-10-22 11:21:24,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:24,403 INFO L462 AbstractCegarLoop]: Abstraction has 6435 states and 14760 transitions. [2019-10-22 11:21:24,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:24,403 INFO L276 IsEmpty]: Start isEmpty. Operand 6435 states and 14760 transitions. [2019-10-22 11:21:24,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-22 11:21:24,408 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:24,409 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:24,409 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:24,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:24,409 INFO L82 PathProgramCache]: Analyzing trace with hash -616735177, now seen corresponding path program 1 times [2019-10-22 11:21:24,409 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:24,409 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599385443] [2019-10-22 11:21:24,410 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:24,410 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:24,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:24,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:24,481 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:21:24,481 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599385443] [2019-10-22 11:21:24,481 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:24,481 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:21:24,481 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824728534] [2019-10-22 11:21:24,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:21:24,482 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:24,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:21:24,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:21:24,482 INFO L87 Difference]: Start difference. First operand 6435 states and 14760 transitions. Second operand 4 states. [2019-10-22 11:21:24,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:24,587 INFO L93 Difference]: Finished difference Result 6823 states and 15667 transitions. [2019-10-22 11:21:24,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:21:24,588 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-10-22 11:21:24,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:24,596 INFO L225 Difference]: With dead ends: 6823 [2019-10-22 11:21:24,596 INFO L226 Difference]: Without dead ends: 6823 [2019-10-22 11:21:24,596 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:21:24,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6823 states. [2019-10-22 11:21:24,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6823 to 6359. [2019-10-22 11:21:24,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6359 states. [2019-10-22 11:21:24,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6359 states to 6359 states and 14673 transitions. [2019-10-22 11:21:24,684 INFO L78 Accepts]: Start accepts. Automaton has 6359 states and 14673 transitions. Word has length 90 [2019-10-22 11:21:24,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:24,685 INFO L462 AbstractCegarLoop]: Abstraction has 6359 states and 14673 transitions. [2019-10-22 11:21:24,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:21:24,685 INFO L276 IsEmpty]: Start isEmpty. Operand 6359 states and 14673 transitions. [2019-10-22 11:21:24,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-22 11:21:24,690 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:24,691 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:24,691 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:24,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:24,691 INFO L82 PathProgramCache]: Analyzing trace with hash 373192540, now seen corresponding path program 1 times [2019-10-22 11:21:24,691 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:24,692 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825560080] [2019-10-22 11:21:24,692 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:24,692 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:24,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:24,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:24,753 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:21:24,753 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825560080] [2019-10-22 11:21:24,753 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:24,753 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:21:24,753 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194774231] [2019-10-22 11:21:24,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:21:24,754 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:24,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:21:24,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:21:24,754 INFO L87 Difference]: Start difference. First operand 6359 states and 14673 transitions. Second operand 5 states. [2019-10-22 11:21:24,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:24,874 INFO L93 Difference]: Finished difference Result 7324 states and 16774 transitions. [2019-10-22 11:21:24,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:21:24,874 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-10-22 11:21:24,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:24,880 INFO L225 Difference]: With dead ends: 7324 [2019-10-22 11:21:24,880 INFO L226 Difference]: Without dead ends: 7324 [2019-10-22 11:21:24,880 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:21:24,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7324 states. [2019-10-22 11:21:24,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7324 to 5724. [2019-10-22 11:21:24,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5724 states. [2019-10-22 11:21:24,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5724 states to 5724 states and 13218 transitions. [2019-10-22 11:21:24,940 INFO L78 Accepts]: Start accepts. Automaton has 5724 states and 13218 transitions. Word has length 92 [2019-10-22 11:21:24,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:24,940 INFO L462 AbstractCegarLoop]: Abstraction has 5724 states and 13218 transitions. [2019-10-22 11:21:24,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:21:24,940 INFO L276 IsEmpty]: Start isEmpty. Operand 5724 states and 13218 transitions. [2019-10-22 11:21:24,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-22 11:21:24,945 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:24,945 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:24,945 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:24,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:24,946 INFO L82 PathProgramCache]: Analyzing trace with hash 118455995, now seen corresponding path program 1 times [2019-10-22 11:21:24,946 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:24,946 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127309651] [2019-10-22 11:21:24,946 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:24,946 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:24,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:24,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:25,010 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:21:25,011 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127309651] [2019-10-22 11:21:25,011 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:25,011 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 11:21:25,011 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816335682] [2019-10-22 11:21:25,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 11:21:25,012 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:25,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 11:21:25,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 11:21:25,012 INFO L87 Difference]: Start difference. First operand 5724 states and 13218 transitions. Second operand 5 states. [2019-10-22 11:21:25,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:25,381 INFO L93 Difference]: Finished difference Result 9776 states and 22784 transitions. [2019-10-22 11:21:25,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 11:21:25,381 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-10-22 11:21:25,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:25,389 INFO L225 Difference]: With dead ends: 9776 [2019-10-22 11:21:25,389 INFO L226 Difference]: Without dead ends: 9760 [2019-10-22 11:21:25,389 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:21:25,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9760 states. [2019-10-22 11:21:25,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9760 to 6548. [2019-10-22 11:21:25,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6548 states. [2019-10-22 11:21:25,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6548 states to 6548 states and 15152 transitions. [2019-10-22 11:21:25,467 INFO L78 Accepts]: Start accepts. Automaton has 6548 states and 15152 transitions. Word has length 92 [2019-10-22 11:21:25,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:25,467 INFO L462 AbstractCegarLoop]: Abstraction has 6548 states and 15152 transitions. [2019-10-22 11:21:25,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 11:21:25,467 INFO L276 IsEmpty]: Start isEmpty. Operand 6548 states and 15152 transitions. [2019-10-22 11:21:25,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-22 11:21:25,475 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:25,475 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:25,475 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:25,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:25,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1363220476, now seen corresponding path program 1 times [2019-10-22 11:21:25,476 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:25,476 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228806063] [2019-10-22 11:21:25,476 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:25,476 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:25,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:25,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:25,545 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:21:25,545 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228806063] [2019-10-22 11:21:25,545 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:25,546 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 11:21:25,546 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652414178] [2019-10-22 11:21:25,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:21:25,546 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:25,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:21:25,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:21:25,547 INFO L87 Difference]: Start difference. First operand 6548 states and 15152 transitions. Second operand 6 states. [2019-10-22 11:21:25,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:25,805 INFO L93 Difference]: Finished difference Result 8814 states and 20118 transitions. [2019-10-22 11:21:25,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-22 11:21:25,805 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-10-22 11:21:25,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:25,812 INFO L225 Difference]: With dead ends: 8814 [2019-10-22 11:21:25,812 INFO L226 Difference]: Without dead ends: 8814 [2019-10-22 11:21:25,812 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-10-22 11:21:25,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8814 states. [2019-10-22 11:21:25,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8814 to 6687. [2019-10-22 11:21:25,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6687 states. [2019-10-22 11:21:25,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6687 states to 6687 states and 15343 transitions. [2019-10-22 11:21:25,890 INFO L78 Accepts]: Start accepts. Automaton has 6687 states and 15343 transitions. Word has length 92 [2019-10-22 11:21:25,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:25,890 INFO L462 AbstractCegarLoop]: Abstraction has 6687 states and 15343 transitions. [2019-10-22 11:21:25,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:21:25,890 INFO L276 IsEmpty]: Start isEmpty. Operand 6687 states and 15343 transitions. [2019-10-22 11:21:25,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-22 11:21:25,896 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:25,896 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:25,896 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:25,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:25,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1180169040, now seen corresponding path program 1 times [2019-10-22 11:21:25,897 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:25,897 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827217111] [2019-10-22 11:21:25,897 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:25,897 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:25,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:25,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:26,033 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:21:26,033 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827217111] [2019-10-22 11:21:26,034 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:26,034 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 11:21:26,034 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046988563] [2019-10-22 11:21:26,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 11:21:26,034 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:26,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 11:21:26,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-22 11:21:26,035 INFO L87 Difference]: Start difference. First operand 6687 states and 15343 transitions. Second operand 8 states. [2019-10-22 11:21:26,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:26,298 INFO L93 Difference]: Finished difference Result 10538 states and 23822 transitions. [2019-10-22 11:21:26,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-22 11:21:26,299 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 92 [2019-10-22 11:21:26,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:26,307 INFO L225 Difference]: With dead ends: 10538 [2019-10-22 11:21:26,307 INFO L226 Difference]: Without dead ends: 10538 [2019-10-22 11:21:26,308 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-10-22 11:21:26,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10538 states. [2019-10-22 11:21:26,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10538 to 7565. [2019-10-22 11:21:26,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7565 states. [2019-10-22 11:21:26,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7565 states to 7565 states and 17306 transitions. [2019-10-22 11:21:26,398 INFO L78 Accepts]: Start accepts. Automaton has 7565 states and 17306 transitions. Word has length 92 [2019-10-22 11:21:26,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:26,398 INFO L462 AbstractCegarLoop]: Abstraction has 7565 states and 17306 transitions. [2019-10-22 11:21:26,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 11:21:26,399 INFO L276 IsEmpty]: Start isEmpty. Operand 7565 states and 17306 transitions. [2019-10-22 11:21:26,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-22 11:21:26,405 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:26,405 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:26,405 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:26,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:26,405 INFO L82 PathProgramCache]: Analyzing trace with hash -897040303, now seen corresponding path program 1 times [2019-10-22 11:21:26,405 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:26,406 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082719897] [2019-10-22 11:21:26,406 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:26,406 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:26,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:26,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:26,532 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:21:26,532 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082719897] [2019-10-22 11:21:26,533 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:26,533 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-22 11:21:26,533 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748476542] [2019-10-22 11:21:26,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 11:21:26,533 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:26,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 11:21:26,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:21:26,534 INFO L87 Difference]: Start difference. First operand 7565 states and 17306 transitions. Second operand 9 states. [2019-10-22 11:21:27,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:27,113 INFO L93 Difference]: Finished difference Result 10846 states and 24728 transitions. [2019-10-22 11:21:27,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-22 11:21:27,114 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 92 [2019-10-22 11:21:27,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:27,126 INFO L225 Difference]: With dead ends: 10846 [2019-10-22 11:21:27,126 INFO L226 Difference]: Without dead ends: 10814 [2019-10-22 11:21:27,126 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2019-10-22 11:21:27,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10814 states. [2019-10-22 11:21:27,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10814 to 9413. [2019-10-22 11:21:27,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9413 states. [2019-10-22 11:21:27,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9413 states to 9413 states and 21423 transitions. [2019-10-22 11:21:27,265 INFO L78 Accepts]: Start accepts. Automaton has 9413 states and 21423 transitions. Word has length 92 [2019-10-22 11:21:27,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:27,265 INFO L462 AbstractCegarLoop]: Abstraction has 9413 states and 21423 transitions. [2019-10-22 11:21:27,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 11:21:27,265 INFO L276 IsEmpty]: Start isEmpty. Operand 9413 states and 21423 transitions. [2019-10-22 11:21:27,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-22 11:21:27,276 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:27,276 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:27,277 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:27,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:27,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1600975634, now seen corresponding path program 1 times [2019-10-22 11:21:27,277 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:27,277 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791735344] [2019-10-22 11:21:27,277 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:27,277 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:27,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:27,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:27,380 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:21:27,380 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791735344] [2019-10-22 11:21:27,381 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:27,381 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 11:21:27,381 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282751926] [2019-10-22 11:21:27,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 11:21:27,381 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:27,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 11:21:27,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-22 11:21:27,382 INFO L87 Difference]: Start difference. First operand 9413 states and 21423 transitions. Second operand 7 states. [2019-10-22 11:21:27,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:27,513 INFO L93 Difference]: Finished difference Result 12417 states and 28512 transitions. [2019-10-22 11:21:27,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 11:21:27,514 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-10-22 11:21:27,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:27,524 INFO L225 Difference]: With dead ends: 12417 [2019-10-22 11:21:27,524 INFO L226 Difference]: Without dead ends: 12417 [2019-10-22 11:21:27,525 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:21:27,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12417 states. [2019-10-22 11:21:27,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12417 to 8615. [2019-10-22 11:21:27,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8615 states. [2019-10-22 11:21:27,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8615 states to 8615 states and 19456 transitions. [2019-10-22 11:21:27,629 INFO L78 Accepts]: Start accepts. Automaton has 8615 states and 19456 transitions. Word has length 92 [2019-10-22 11:21:27,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:27,629 INFO L462 AbstractCegarLoop]: Abstraction has 8615 states and 19456 transitions. [2019-10-22 11:21:27,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 11:21:27,630 INFO L276 IsEmpty]: Start isEmpty. Operand 8615 states and 19456 transitions. [2019-10-22 11:21:27,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-22 11:21:27,636 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:27,636 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:27,636 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:27,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:27,636 INFO L82 PathProgramCache]: Analyzing trace with hash 756503763, now seen corresponding path program 1 times [2019-10-22 11:21:27,636 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:27,637 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345936109] [2019-10-22 11:21:27,637 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:27,637 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:27,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:27,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:27,690 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:21:27,690 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345936109] [2019-10-22 11:21:27,691 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:27,691 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:21:27,691 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916327019] [2019-10-22 11:21:27,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:21:27,691 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:27,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:21:27,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:21:27,692 INFO L87 Difference]: Start difference. First operand 8615 states and 19456 transitions. Second operand 3 states. [2019-10-22 11:21:27,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:27,725 INFO L93 Difference]: Finished difference Result 8551 states and 19200 transitions. [2019-10-22 11:21:27,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:21:27,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-10-22 11:21:27,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:27,735 INFO L225 Difference]: With dead ends: 8551 [2019-10-22 11:21:27,735 INFO L226 Difference]: Without dead ends: 8519 [2019-10-22 11:21:27,735 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:21:27,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8519 states. [2019-10-22 11:21:27,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8519 to 7057. [2019-10-22 11:21:27,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7057 states. [2019-10-22 11:21:27,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7057 states to 7057 states and 15788 transitions. [2019-10-22 11:21:27,836 INFO L78 Accepts]: Start accepts. Automaton has 7057 states and 15788 transitions. Word has length 92 [2019-10-22 11:21:27,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:27,837 INFO L462 AbstractCegarLoop]: Abstraction has 7057 states and 15788 transitions. [2019-10-22 11:21:27,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:21:27,837 INFO L276 IsEmpty]: Start isEmpty. Operand 7057 states and 15788 transitions. [2019-10-22 11:21:27,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-22 11:21:27,844 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:27,844 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:27,844 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:27,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:27,845 INFO L82 PathProgramCache]: Analyzing trace with hash -142834974, now seen corresponding path program 1 times [2019-10-22 11:21:27,845 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:27,845 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318165281] [2019-10-22 11:21:27,845 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:27,845 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:27,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:27,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:21:27,997 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:21:27,998 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318165281] [2019-10-22 11:21:27,998 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:21:27,998 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-22 11:21:27,998 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288067670] [2019-10-22 11:21:27,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 11:21:27,998 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:21:27,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 11:21:27,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:21:27,999 INFO L87 Difference]: Start difference. First operand 7057 states and 15788 transitions. Second operand 10 states. [2019-10-22 11:21:28,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:21:28,356 INFO L93 Difference]: Finished difference Result 22125 states and 50313 transitions. [2019-10-22 11:21:28,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-22 11:21:28,356 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 94 [2019-10-22 11:21:28,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:21:28,373 INFO L225 Difference]: With dead ends: 22125 [2019-10-22 11:21:28,373 INFO L226 Difference]: Without dead ends: 14911 [2019-10-22 11:21:28,374 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-10-22 11:21:28,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14911 states. [2019-10-22 11:21:28,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14911 to 6922. [2019-10-22 11:21:28,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6922 states. [2019-10-22 11:21:28,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6922 states to 6922 states and 15411 transitions. [2019-10-22 11:21:28,500 INFO L78 Accepts]: Start accepts. Automaton has 6922 states and 15411 transitions. Word has length 94 [2019-10-22 11:21:28,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:21:28,500 INFO L462 AbstractCegarLoop]: Abstraction has 6922 states and 15411 transitions. [2019-10-22 11:21:28,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 11:21:28,500 INFO L276 IsEmpty]: Start isEmpty. Operand 6922 states and 15411 transitions. [2019-10-22 11:21:28,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-22 11:21:28,507 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:21:28,507 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:21:28,508 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:21:28,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:21:28,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1965090686, now seen corresponding path program 2 times [2019-10-22 11:21:28,508 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:21:28,509 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105615255] [2019-10-22 11:21:28,509 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:28,509 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:21:28,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:21:28,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:21:28,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:21:28,599 INFO L168 tionRefinementEngine]: Strategy TAIPAN found a feasible trace [2019-10-22 11:21:28,600 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 11:21:28,741 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-10-22 11:21:28,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:21:28 BasicIcfg [2019-10-22 11:21:28,743 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:21:28,743 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:21:28,743 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:21:28,744 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:21:28,744 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:20:58" (3/4) ... [2019-10-22 11:21:28,746 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 11:21:28,859 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_5b71f6a9-a2f3-4263-8b7f-dc570891d050/bin/utaipan/witness.graphml [2019-10-22 11:21:28,860 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:21:28,861 INFO L168 Benchmark]: Toolchain (without parser) took 31695.98 ms. Allocated memory was 1.0 GB in the beginning and 3.9 GB in the end (delta: 2.9 GB). Free memory was 937.8 MB in the beginning and 1.5 GB in the end (delta: -536.8 MB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. [2019-10-22 11:21:28,862 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:21:28,862 INFO L168 Benchmark]: CACSL2BoogieTranslator took 644.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 937.8 MB in the beginning and 1.1 GB in the end (delta: -158.9 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:28,862 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.31 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:28,862 INFO L168 Benchmark]: Boogie Preprocessor took 43.23 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:21:28,863 INFO L168 Benchmark]: RCFGBuilder took 627.97 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.6 MB). Peak memory consumption was 48.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:28,863 INFO L168 Benchmark]: TraceAbstraction took 30208.49 ms. Allocated memory was 1.2 GB in the beginning and 3.9 GB in the end (delta: 2.7 GB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -505.6 MB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. [2019-10-22 11:21:28,863 INFO L168 Benchmark]: Witness Printer took 116.47 ms. Allocated memory is still 3.9 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 72.3 MB). Peak memory consumption was 72.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:21:28,865 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 644.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 937.8 MB in the beginning and 1.1 GB in the end (delta: -158.9 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.31 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.23 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 627.97 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.6 MB). Peak memory consumption was 48.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 30208.49 ms. Allocated memory was 1.2 GB in the beginning and 3.9 GB in the end (delta: 2.7 GB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -505.6 MB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. * Witness Printer took 116.47 ms. Allocated memory is still 3.9 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 72.3 MB). Peak memory consumption was 72.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L697] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L698] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L700] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L702] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L703] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L704] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L705] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L706] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L707] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L708] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L709] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L710] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L711] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L712] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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}] [L713] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L714] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L715] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L716] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L717] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L718] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L791] 0 pthread_t t1445; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L792] FCALL, FORK 0 pthread_create(&t1445, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L722] 1 y$w_buff1 = y$w_buff0 [L723] 1 y$w_buff0 = 1 [L724] 1 y$w_buff1_used = y$w_buff0_used [L725] 1 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L793] 0 pthread_t t1446; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L794] FCALL, FORK 0 pthread_create(&t1446, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L727] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L728] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L729] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L730] 1 y$r_buff0_thd1 = (_Bool)1 [L733] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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] [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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] [L750] 2 x = 2 [L753] 2 weak$$choice0 = __VERIFIER_nondet_pointer() [L754] 2 weak$$choice2 = __VERIFIER_nondet_pointer() [L755] 2 y$flush_delayed = weak$$choice2 [L756] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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] [L757] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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] [L736] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L737] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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] [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L743] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L758] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L758] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L759] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L759] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L760] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L762] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L762] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L763] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L763] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L764] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L765] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, 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=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y = y$flush_delayed ? y$mem_tmp : y [L766] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L769] 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=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L769] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L769] 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=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L769] 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) [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] 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 [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] 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 [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] 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=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L773] 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 [L776] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L796] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L800] 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_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L800] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L800] 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_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L800] 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) [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L801] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L802] 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_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 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 [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L804] 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_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 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 [L807] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 221 locations, 3 error locations. Result: UNSAFE, OverallTime: 30.0s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 13.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8407 SDtfs, 8257 SDslu, 18426 SDs, 0 SdLazy, 6136 SolverSat, 401 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 291 GetRequests, 89 SyntacticMatches, 16 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63434occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.7s AutomataMinimizationTime, 30 MinimizatonAttempts, 85286 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 2172 NumberOfCodeBlocks, 2172 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2048 ConstructedInterpolants, 0 QuantifiedInterpolants, 356712 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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...