./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix002_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_fd14a807-32f6-4a35-876d-de9f26cda4d3/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_fd14a807-32f6-4a35-876d-de9f26cda4d3/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_fd14a807-32f6-4a35-876d-de9f26cda4d3/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_fd14a807-32f6-4a35-876d-de9f26cda4d3/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix002_tso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_fd14a807-32f6-4a35-876d-de9f26cda4d3/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_fd14a807-32f6-4a35-876d-de9f26cda4d3/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 66c3784ad0971b0dfab5229f278f32fbe08197da ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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.25-f470102 [2019-12-07 20:53:24,697 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 20:53:24,698 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 20:53:24,705 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 20:53:24,705 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 20:53:24,706 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 20:53:24,707 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 20:53:24,708 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 20:53:24,709 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 20:53:24,710 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 20:53:24,711 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 20:53:24,711 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 20:53:24,712 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 20:53:24,712 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 20:53:24,713 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 20:53:24,714 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 20:53:24,714 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 20:53:24,715 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 20:53:24,716 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 20:53:24,717 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 20:53:24,719 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 20:53:24,719 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 20:53:24,720 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 20:53:24,720 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 20:53:24,722 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 20:53:24,722 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 20:53:24,722 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 20:53:24,723 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 20:53:24,723 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 20:53:24,724 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 20:53:24,724 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 20:53:24,724 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 20:53:24,725 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 20:53:24,725 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 20:53:24,726 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 20:53:24,726 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 20:53:24,726 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 20:53:24,726 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 20:53:24,726 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 20:53:24,727 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 20:53:24,727 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 20:53:24,728 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_fd14a807-32f6-4a35-876d-de9f26cda4d3/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 20:53:24,738 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 20:53:24,738 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 20:53:24,739 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 20:53:24,739 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 20:53:24,739 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 20:53:24,739 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 20:53:24,739 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 20:53:24,739 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 20:53:24,739 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 20:53:24,740 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 20:53:24,740 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 20:53:24,740 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 20:53:24,740 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 20:53:24,740 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 20:53:24,740 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 20:53:24,741 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 20:53:24,741 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 20:53:24,741 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 20:53:24,741 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 20:53:24,741 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 20:53:24,741 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 20:53:24,741 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 20:53:24,741 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 20:53:24,742 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 20:53:24,742 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 20:53:24,742 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 20:53:24,742 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 20:53:24,742 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 20:53:24,742 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 20:53:24,742 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 20:53:24,742 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 20:53:24,742 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 20:53:24,743 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 20:53:24,743 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 20:53:24,743 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 20:53:24,743 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 20:53:24,743 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 20:53:24,743 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 20:53:24,743 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 20:53:24,743 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 20:53:24,743 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/run_dir_fd14a807-32f6-4a35-876d-de9f26cda4d3/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 -> 66c3784ad0971b0dfab5229f278f32fbe08197da [2019-12-07 20:53:24,841 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 20:53:24,850 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 20:53:24,852 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 20:53:24,853 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 20:53:24,853 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 20:53:24,854 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_fd14a807-32f6-4a35-876d-de9f26cda4d3/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix002_tso.opt.i [2019-12-07 20:53:24,890 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fd14a807-32f6-4a35-876d-de9f26cda4d3/bin/utaipan/data/deb01523a/e3adacd45cad4d89bebe5e69c1218567/FLAGc761c96f6 [2019-12-07 20:53:25,373 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 20:53:25,373 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_fd14a807-32f6-4a35-876d-de9f26cda4d3/sv-benchmarks/c/pthread-wmm/mix002_tso.opt.i [2019-12-07 20:53:25,383 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fd14a807-32f6-4a35-876d-de9f26cda4d3/bin/utaipan/data/deb01523a/e3adacd45cad4d89bebe5e69c1218567/FLAGc761c96f6 [2019-12-07 20:53:25,392 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_fd14a807-32f6-4a35-876d-de9f26cda4d3/bin/utaipan/data/deb01523a/e3adacd45cad4d89bebe5e69c1218567 [2019-12-07 20:53:25,394 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 20:53:25,395 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 20:53:25,395 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 20:53:25,395 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 20:53:25,398 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 20:53:25,398 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:53:25" (1/1) ... [2019-12-07 20:53:25,400 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25138a46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:53:25, skipping insertion in model container [2019-12-07 20:53:25,400 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:53:25" (1/1) ... [2019-12-07 20:53:25,405 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 20:53:25,442 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 20:53:25,712 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:53:25,719 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 20:53:25,761 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:53:25,805 INFO L208 MainTranslator]: Completed translation [2019-12-07 20:53:25,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:53:25 WrapperNode [2019-12-07 20:53:25,806 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 20:53:25,806 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 20:53:25,806 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 20:53:25,806 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 20:53:25,812 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:53:25" (1/1) ... [2019-12-07 20:53:25,825 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:53:25" (1/1) ... [2019-12-07 20:53:25,845 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 20:53:25,846 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 20:53:25,846 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 20:53:25,846 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 20:53:25,852 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:53:25" (1/1) ... [2019-12-07 20:53:25,852 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:53:25" (1/1) ... [2019-12-07 20:53:25,856 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:53:25" (1/1) ... [2019-12-07 20:53:25,856 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:53:25" (1/1) ... [2019-12-07 20:53:25,863 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:53:25" (1/1) ... [2019-12-07 20:53:25,867 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:53:25" (1/1) ... [2019-12-07 20:53:25,869 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:53:25" (1/1) ... [2019-12-07 20:53:25,872 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 20:53:25,873 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 20:53:25,873 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 20:53:25,873 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 20:53:25,874 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:53:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd14a807-32f6-4a35-876d-de9f26cda4d3/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-12-07 20:53:25,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 20:53:25,914 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 20:53:25,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 20:53:25,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 20:53:25,914 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 20:53:25,914 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 20:53:25,914 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 20:53:25,915 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 20:53:25,915 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 20:53:25,915 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 20:53:25,915 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 20:53:25,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 20:53:25,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 20:53:25,916 WARN L205 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 20:53:26,322 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 20:53:26,322 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 20:53:26,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:53:26 BoogieIcfgContainer [2019-12-07 20:53:26,323 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 20:53:26,324 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 20:53:26,324 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 20:53:26,325 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 20:53:26,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 08:53:25" (1/3) ... [2019-12-07 20:53:26,326 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75e2edc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:53:26, skipping insertion in model container [2019-12-07 20:53:26,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:53:25" (2/3) ... [2019-12-07 20:53:26,326 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75e2edc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:53:26, skipping insertion in model container [2019-12-07 20:53:26,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:53:26" (3/3) ... [2019-12-07 20:53:26,328 INFO L109 eAbstractionObserver]: Analyzing ICFG mix002_tso.opt.i [2019-12-07 20:53:26,334 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 20:53:26,334 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 20:53:26,339 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 20:53:26,339 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 20:53:26,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,367 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,367 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,369 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,369 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,374 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,375 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,385 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,385 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,386 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,386 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,386 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,386 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,387 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,388 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,397 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,398 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,399 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,400 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,401 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,402 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 20:53:26,413 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 20:53:26,426 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 20:53:26,426 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 20:53:26,426 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 20:53:26,426 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 20:53:26,426 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 20:53:26,426 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 20:53:26,426 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 20:53:26,426 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 20:53:26,437 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 198 places, 244 transitions [2019-12-07 20:53:26,438 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 198 places, 244 transitions [2019-12-07 20:53:26,500 INFO L134 PetriNetUnfolder]: 56/241 cut-off events. [2019-12-07 20:53:26,500 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 20:53:26,512 INFO L76 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 241 events. 56/241 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 925 event pairs. 9/192 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 20:53:26,534 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 198 places, 244 transitions [2019-12-07 20:53:26,581 INFO L134 PetriNetUnfolder]: 56/241 cut-off events. [2019-12-07 20:53:26,581 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 20:53:26,589 INFO L76 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 241 events. 56/241 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 925 event pairs. 9/192 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 20:53:26,612 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-07 20:53:26,613 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 20:53:30,130 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-12-07 20:53:30,369 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-07 20:53:30,477 INFO L206 etLargeBlockEncoding]: Checked pairs total: 139722 [2019-12-07 20:53:30,477 INFO L214 etLargeBlockEncoding]: Total number of compositions: 132 [2019-12-07 20:53:30,479 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 105 places, 127 transitions [2019-12-07 20:53:32,996 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 42030 states. [2019-12-07 20:53:32,997 INFO L276 IsEmpty]: Start isEmpty. Operand 42030 states. [2019-12-07 20:53:33,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 20:53:33,002 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:53:33,002 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:53:33,002 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:53:33,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:53:33,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1345363696, now seen corresponding path program 1 times [2019-12-07 20:53:33,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:53:33,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147097634] [2019-12-07 20:53:33,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:53:33,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:53:33,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:53:33,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147097634] [2019-12-07 20:53:33,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:53:33,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 20:53:33,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317370136] [2019-12-07 20:53:33,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:53:33,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:53:33,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:53:33,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:53:33,172 INFO L87 Difference]: Start difference. First operand 42030 states. Second operand 3 states. [2019-12-07 20:53:33,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:53:33,578 INFO L93 Difference]: Finished difference Result 41750 states and 172028 transitions. [2019-12-07 20:53:33,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:53:33,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 20:53:33,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:53:33,817 INFO L225 Difference]: With dead ends: 41750 [2019-12-07 20:53:33,817 INFO L226 Difference]: Without dead ends: 38894 [2019-12-07 20:53:33,818 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-12-07 20:53:34,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38894 states. [2019-12-07 20:53:35,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38894 to 38894. [2019-12-07 20:53:35,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38894 states. [2019-12-07 20:53:35,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38894 states to 38894 states and 160140 transitions. [2019-12-07 20:53:35,225 INFO L78 Accepts]: Start accepts. Automaton has 38894 states and 160140 transitions. Word has length 7 [2019-12-07 20:53:35,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:53:35,226 INFO L462 AbstractCegarLoop]: Abstraction has 38894 states and 160140 transitions. [2019-12-07 20:53:35,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:53:35,226 INFO L276 IsEmpty]: Start isEmpty. Operand 38894 states and 160140 transitions. [2019-12-07 20:53:35,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 20:53:35,229 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:53:35,229 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:53:35,230 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:53:35,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:53:35,230 INFO L82 PathProgramCache]: Analyzing trace with hash 823513967, now seen corresponding path program 1 times [2019-12-07 20:53:35,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:53:35,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319426934] [2019-12-07 20:53:35,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:53:35,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:53:35,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:53:35,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319426934] [2019-12-07 20:53:35,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:53:35,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:53:35,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713354769] [2019-12-07 20:53:35,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:53:35,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:53:35,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:53:35,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:53:35,280 INFO L87 Difference]: Start difference. First operand 38894 states and 160140 transitions. Second operand 3 states. [2019-12-07 20:53:35,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:53:35,401 INFO L93 Difference]: Finished difference Result 21910 states and 79049 transitions. [2019-12-07 20:53:35,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:53:35,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-07 20:53:35,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:53:35,660 INFO L225 Difference]: With dead ends: 21910 [2019-12-07 20:53:35,660 INFO L226 Difference]: Without dead ends: 21910 [2019-12-07 20:53:35,661 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:53:35,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21910 states. [2019-12-07 20:53:36,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21910 to 21910. [2019-12-07 20:53:36,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21910 states. [2019-12-07 20:53:36,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21910 states to 21910 states and 79049 transitions. [2019-12-07 20:53:36,171 INFO L78 Accepts]: Start accepts. Automaton has 21910 states and 79049 transitions. Word has length 13 [2019-12-07 20:53:36,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:53:36,171 INFO L462 AbstractCegarLoop]: Abstraction has 21910 states and 79049 transitions. [2019-12-07 20:53:36,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:53:36,172 INFO L276 IsEmpty]: Start isEmpty. Operand 21910 states and 79049 transitions. [2019-12-07 20:53:36,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 20:53:36,173 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:53:36,173 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:53:36,173 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:53:36,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:53:36,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1741557527, now seen corresponding path program 1 times [2019-12-07 20:53:36,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:53:36,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087074284] [2019-12-07 20:53:36,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:53:36,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:53:36,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:53:36,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087074284] [2019-12-07 20:53:36,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:53:36,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:53:36,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818324902] [2019-12-07 20:53:36,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:53:36,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:53:36,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:53:36,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:53:36,228 INFO L87 Difference]: Start difference. First operand 21910 states and 79049 transitions. Second operand 4 states. [2019-12-07 20:53:36,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:53:36,523 INFO L93 Difference]: Finished difference Result 33446 states and 115605 transitions. [2019-12-07 20:53:36,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:53:36,523 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 20:53:36,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:53:36,578 INFO L225 Difference]: With dead ends: 33446 [2019-12-07 20:53:36,579 INFO L226 Difference]: Without dead ends: 33430 [2019-12-07 20:53:36,579 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-12-07 20:53:37,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33430 states. [2019-12-07 20:53:37,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33430 to 32663. [2019-12-07 20:53:37,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32663 states. [2019-12-07 20:53:37,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32663 states to 32663 states and 113580 transitions. [2019-12-07 20:53:37,434 INFO L78 Accepts]: Start accepts. Automaton has 32663 states and 113580 transitions. Word has length 14 [2019-12-07 20:53:37,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:53:37,435 INFO L462 AbstractCegarLoop]: Abstraction has 32663 states and 113580 transitions. [2019-12-07 20:53:37,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:53:37,435 INFO L276 IsEmpty]: Start isEmpty. Operand 32663 states and 113580 transitions. [2019-12-07 20:53:37,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 20:53:37,436 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:53:37,436 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:53:37,437 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:53:37,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:53:37,437 INFO L82 PathProgramCache]: Analyzing trace with hash 77685178, now seen corresponding path program 1 times [2019-12-07 20:53:37,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:53:37,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092930989] [2019-12-07 20:53:37,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:53:37,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:53:37,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:53:37,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092930989] [2019-12-07 20:53:37,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:53:37,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:53:37,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738069885] [2019-12-07 20:53:37,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:53:37,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:53:37,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:53:37,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:53:37,479 INFO L87 Difference]: Start difference. First operand 32663 states and 113580 transitions. Second operand 4 states. [2019-12-07 20:53:37,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:53:37,751 INFO L93 Difference]: Finished difference Result 41637 states and 142451 transitions. [2019-12-07 20:53:37,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:53:37,752 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 20:53:37,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:53:37,819 INFO L225 Difference]: With dead ends: 41637 [2019-12-07 20:53:37,819 INFO L226 Difference]: Without dead ends: 41624 [2019-12-07 20:53:37,820 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-12-07 20:53:38,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41624 states. [2019-12-07 20:53:38,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41624 to 37724. [2019-12-07 20:53:38,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37724 states. [2019-12-07 20:53:38,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37724 states to 37724 states and 130298 transitions. [2019-12-07 20:53:38,723 INFO L78 Accepts]: Start accepts. Automaton has 37724 states and 130298 transitions. Word has length 16 [2019-12-07 20:53:38,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:53:38,723 INFO L462 AbstractCegarLoop]: Abstraction has 37724 states and 130298 transitions. [2019-12-07 20:53:38,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:53:38,723 INFO L276 IsEmpty]: Start isEmpty. Operand 37724 states and 130298 transitions. [2019-12-07 20:53:38,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 20:53:38,725 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:53:38,726 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:53:38,726 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:53:38,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:53:38,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1886698225, now seen corresponding path program 1 times [2019-12-07 20:53:38,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:53:38,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899840712] [2019-12-07 20:53:38,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:53:38,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:53:38,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:53:38,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899840712] [2019-12-07 20:53:38,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:53:38,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:53:38,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154946611] [2019-12-07 20:53:38,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:53:38,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:53:38,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:53:38,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:53:38,749 INFO L87 Difference]: Start difference. First operand 37724 states and 130298 transitions. Second operand 3 states. [2019-12-07 20:53:38,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:53:38,979 INFO L93 Difference]: Finished difference Result 64399 states and 211767 transitions. [2019-12-07 20:53:38,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:53:38,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 20:53:38,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:53:39,093 INFO L225 Difference]: With dead ends: 64399 [2019-12-07 20:53:39,093 INFO L226 Difference]: Without dead ends: 64399 [2019-12-07 20:53:39,093 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:53:39,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64399 states. [2019-12-07 20:53:40,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64399 to 57368. [2019-12-07 20:53:40,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57368 states. [2019-12-07 20:53:40,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57368 states to 57368 states and 191630 transitions. [2019-12-07 20:53:40,391 INFO L78 Accepts]: Start accepts. Automaton has 57368 states and 191630 transitions. Word has length 17 [2019-12-07 20:53:40,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:53:40,391 INFO L462 AbstractCegarLoop]: Abstraction has 57368 states and 191630 transitions. [2019-12-07 20:53:40,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:53:40,392 INFO L276 IsEmpty]: Start isEmpty. Operand 57368 states and 191630 transitions. [2019-12-07 20:53:40,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 20:53:40,396 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:53:40,397 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:53:40,397 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:53:40,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:53:40,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1903393538, now seen corresponding path program 1 times [2019-12-07 20:53:40,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:53:40,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836223961] [2019-12-07 20:53:40,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:53:40,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:53:40,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:53:40,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836223961] [2019-12-07 20:53:40,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:53:40,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:53:40,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097334320] [2019-12-07 20:53:40,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:53:40,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:53:40,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:53:40,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:53:40,431 INFO L87 Difference]: Start difference. First operand 57368 states and 191630 transitions. Second operand 4 states. [2019-12-07 20:53:40,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:53:40,465 INFO L93 Difference]: Finished difference Result 8645 states and 23870 transitions. [2019-12-07 20:53:40,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:53:40,466 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 20:53:40,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:53:40,475 INFO L225 Difference]: With dead ends: 8645 [2019-12-07 20:53:40,475 INFO L226 Difference]: Without dead ends: 8645 [2019-12-07 20:53:40,475 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:53:40,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8645 states. [2019-12-07 20:53:40,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8645 to 8645. [2019-12-07 20:53:40,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8645 states. [2019-12-07 20:53:40,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8645 states to 8645 states and 23870 transitions. [2019-12-07 20:53:40,572 INFO L78 Accepts]: Start accepts. Automaton has 8645 states and 23870 transitions. Word has length 19 [2019-12-07 20:53:40,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:53:40,573 INFO L462 AbstractCegarLoop]: Abstraction has 8645 states and 23870 transitions. [2019-12-07 20:53:40,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:53:40,573 INFO L276 IsEmpty]: Start isEmpty. Operand 8645 states and 23870 transitions. [2019-12-07 20:53:40,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 20:53:40,574 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:53:40,574 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:53:40,575 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:53:40,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:53:40,575 INFO L82 PathProgramCache]: Analyzing trace with hash 365892370, now seen corresponding path program 1 times [2019-12-07 20:53:40,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:53:40,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469923167] [2019-12-07 20:53:40,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:53:40,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:53:40,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:53:40,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469923167] [2019-12-07 20:53:40,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:53:40,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:53:40,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446224096] [2019-12-07 20:53:40,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:53:40,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:53:40,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:53:40,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:53:40,607 INFO L87 Difference]: Start difference. First operand 8645 states and 23870 transitions. Second operand 4 states. [2019-12-07 20:53:40,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:53:40,770 INFO L93 Difference]: Finished difference Result 10846 states and 29430 transitions. [2019-12-07 20:53:40,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:53:40,770 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 20:53:40,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:53:40,781 INFO L225 Difference]: With dead ends: 10846 [2019-12-07 20:53:40,781 INFO L226 Difference]: Without dead ends: 10846 [2019-12-07 20:53:40,781 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-12-07 20:53:40,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10846 states. [2019-12-07 20:53:40,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10846 to 8676. [2019-12-07 20:53:40,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8676 states. [2019-12-07 20:53:40,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8676 states to 8676 states and 23953 transitions. [2019-12-07 20:53:40,902 INFO L78 Accepts]: Start accepts. Automaton has 8676 states and 23953 transitions. Word has length 19 [2019-12-07 20:53:40,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:53:40,903 INFO L462 AbstractCegarLoop]: Abstraction has 8676 states and 23953 transitions. [2019-12-07 20:53:40,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:53:40,903 INFO L276 IsEmpty]: Start isEmpty. Operand 8676 states and 23953 transitions. [2019-12-07 20:53:40,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 20:53:40,908 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:53:40,908 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:53:40,908 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:53:40,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:53:40,909 INFO L82 PathProgramCache]: Analyzing trace with hash 49455905, now seen corresponding path program 1 times [2019-12-07 20:53:40,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:53:40,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736104965] [2019-12-07 20:53:40,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:53:40,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:53:40,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:53:40,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736104965] [2019-12-07 20:53:40,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:53:40,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:53:40,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540509860] [2019-12-07 20:53:40,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:53:40,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:53:40,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:53:40,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:53:40,968 INFO L87 Difference]: Start difference. First operand 8676 states and 23953 transitions. Second operand 5 states. [2019-12-07 20:53:41,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:53:41,234 INFO L93 Difference]: Finished difference Result 11423 states and 30587 transitions. [2019-12-07 20:53:41,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 20:53:41,234 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-07 20:53:41,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:53:41,245 INFO L225 Difference]: With dead ends: 11423 [2019-12-07 20:53:41,245 INFO L226 Difference]: Without dead ends: 11422 [2019-12-07 20:53:41,245 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:53:41,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11422 states. [2019-12-07 20:53:41,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11422 to 10672. [2019-12-07 20:53:41,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10672 states. [2019-12-07 20:53:41,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10672 states to 10672 states and 28971 transitions. [2019-12-07 20:53:41,368 INFO L78 Accepts]: Start accepts. Automaton has 10672 states and 28971 transitions. Word has length 31 [2019-12-07 20:53:41,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:53:41,368 INFO L462 AbstractCegarLoop]: Abstraction has 10672 states and 28971 transitions. [2019-12-07 20:53:41,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:53:41,368 INFO L276 IsEmpty]: Start isEmpty. Operand 10672 states and 28971 transitions. [2019-12-07 20:53:41,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 20:53:41,375 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:53:41,375 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:53:41,375 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:53:41,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:53:41,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1183609133, now seen corresponding path program 1 times [2019-12-07 20:53:41,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:53:41,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947728165] [2019-12-07 20:53:41,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:53:41,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:53:41,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:53:41,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947728165] [2019-12-07 20:53:41,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:53:41,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:53:41,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788770121] [2019-12-07 20:53:41,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:53:41,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:53:41,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:53:41,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:53:41,403 INFO L87 Difference]: Start difference. First operand 10672 states and 28971 transitions. Second operand 3 states. [2019-12-07 20:53:41,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:53:41,465 INFO L93 Difference]: Finished difference Result 11455 states and 29383 transitions. [2019-12-07 20:53:41,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:53:41,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-12-07 20:53:41,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:53:41,476 INFO L225 Difference]: With dead ends: 11455 [2019-12-07 20:53:41,476 INFO L226 Difference]: Without dead ends: 11455 [2019-12-07 20:53:41,477 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:53:41,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11455 states. [2019-12-07 20:53:41,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11455 to 10717. [2019-12-07 20:53:41,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10717 states. [2019-12-07 20:53:41,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10717 states to 10717 states and 27701 transitions. [2019-12-07 20:53:41,596 INFO L78 Accepts]: Start accepts. Automaton has 10717 states and 27701 transitions. Word has length 34 [2019-12-07 20:53:41,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:53:41,596 INFO L462 AbstractCegarLoop]: Abstraction has 10717 states and 27701 transitions. [2019-12-07 20:53:41,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:53:41,597 INFO L276 IsEmpty]: Start isEmpty. Operand 10717 states and 27701 transitions. [2019-12-07 20:53:41,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 20:53:41,608 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:53:41,609 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:53:41,609 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:53:41,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:53:41,609 INFO L82 PathProgramCache]: Analyzing trace with hash -608757126, now seen corresponding path program 1 times [2019-12-07 20:53:41,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:53:41,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464219583] [2019-12-07 20:53:41,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:53:41,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:53:41,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:53:41,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464219583] [2019-12-07 20:53:41,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:53:41,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:53:41,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520944748] [2019-12-07 20:53:41,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:53:41,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:53:41,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:53:41,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:53:41,656 INFO L87 Difference]: Start difference. First operand 10717 states and 27701 transitions. Second operand 5 states. [2019-12-07 20:53:41,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:53:41,691 INFO L93 Difference]: Finished difference Result 8191 states and 22057 transitions. [2019-12-07 20:53:41,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:53:41,692 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2019-12-07 20:53:41,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:53:41,700 INFO L225 Difference]: With dead ends: 8191 [2019-12-07 20:53:41,700 INFO L226 Difference]: Without dead ends: 8191 [2019-12-07 20:53:41,700 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:53:41,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8191 states. [2019-12-07 20:53:41,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8191 to 6851. [2019-12-07 20:53:41,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6851 states. [2019-12-07 20:53:41,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6851 states to 6851 states and 18809 transitions. [2019-12-07 20:53:41,781 INFO L78 Accepts]: Start accepts. Automaton has 6851 states and 18809 transitions. Word has length 36 [2019-12-07 20:53:41,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:53:41,781 INFO L462 AbstractCegarLoop]: Abstraction has 6851 states and 18809 transitions. [2019-12-07 20:53:41,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:53:41,781 INFO L276 IsEmpty]: Start isEmpty. Operand 6851 states and 18809 transitions. [2019-12-07 20:53:41,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-07 20:53:41,788 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:53:41,789 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:53:41,789 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:53:41,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:53:41,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1974047026, now seen corresponding path program 1 times [2019-12-07 20:53:41,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:53:41,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842061589] [2019-12-07 20:53:41,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:53:41,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:53:41,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:53:41,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842061589] [2019-12-07 20:53:41,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:53:41,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:53:41,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925880465] [2019-12-07 20:53:41,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:53:41,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:53:41,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:53:41,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:53:41,878 INFO L87 Difference]: Start difference. First operand 6851 states and 18809 transitions. Second operand 4 states. [2019-12-07 20:53:42,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:53:42,006 INFO L93 Difference]: Finished difference Result 7717 states and 20876 transitions. [2019-12-07 20:53:42,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:53:42,006 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-12-07 20:53:42,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:53:42,013 INFO L225 Difference]: With dead ends: 7717 [2019-12-07 20:53:42,013 INFO L226 Difference]: Without dead ends: 7717 [2019-12-07 20:53:42,014 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:53:42,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7717 states. [2019-12-07 20:53:42,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7717 to 7445. [2019-12-07 20:53:42,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7445 states. [2019-12-07 20:53:42,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7445 states to 7445 states and 20174 transitions. [2019-12-07 20:53:42,095 INFO L78 Accepts]: Start accepts. Automaton has 7445 states and 20174 transitions. Word has length 61 [2019-12-07 20:53:42,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:53:42,095 INFO L462 AbstractCegarLoop]: Abstraction has 7445 states and 20174 transitions. [2019-12-07 20:53:42,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:53:42,095 INFO L276 IsEmpty]: Start isEmpty. Operand 7445 states and 20174 transitions. [2019-12-07 20:53:42,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-07 20:53:42,103 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:53:42,104 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:53:42,104 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:53:42,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:53:42,104 INFO L82 PathProgramCache]: Analyzing trace with hash -519898424, now seen corresponding path program 2 times [2019-12-07 20:53:42,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:53:42,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530112077] [2019-12-07 20:53:42,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:53:42,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:53:42,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:53:42,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530112077] [2019-12-07 20:53:42,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:53:42,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:53:42,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984317948] [2019-12-07 20:53:42,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:53:42,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:53:42,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:53:42,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:53:42,154 INFO L87 Difference]: Start difference. First operand 7445 states and 20174 transitions. Second operand 3 states. [2019-12-07 20:53:42,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:53:42,183 INFO L93 Difference]: Finished difference Result 7445 states and 20173 transitions. [2019-12-07 20:53:42,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:53:42,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-12-07 20:53:42,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:53:42,192 INFO L225 Difference]: With dead ends: 7445 [2019-12-07 20:53:42,193 INFO L226 Difference]: Without dead ends: 7445 [2019-12-07 20:53:42,193 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-12-07 20:53:42,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7445 states. [2019-12-07 20:53:42,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7445 to 7296. [2019-12-07 20:53:42,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7296 states. [2019-12-07 20:53:42,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7296 states to 7296 states and 19835 transitions. [2019-12-07 20:53:42,270 INFO L78 Accepts]: Start accepts. Automaton has 7296 states and 19835 transitions. Word has length 61 [2019-12-07 20:53:42,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:53:42,270 INFO L462 AbstractCegarLoop]: Abstraction has 7296 states and 19835 transitions. [2019-12-07 20:53:42,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:53:42,270 INFO L276 IsEmpty]: Start isEmpty. Operand 7296 states and 19835 transitions. [2019-12-07 20:53:42,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 20:53:42,279 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:53:42,279 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 20:53:42,279 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:53:42,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:53:42,279 INFO L82 PathProgramCache]: Analyzing trace with hash 2143606157, now seen corresponding path program 1 times [2019-12-07 20:53:42,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:53:42,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320106541] [2019-12-07 20:53:42,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:53:42,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:53:42,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:53:42,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320106541] [2019-12-07 20:53:42,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:53:42,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 20:53:42,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546947512] [2019-12-07 20:53:42,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:53:42,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:53:42,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:53:42,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:53:42,384 INFO L87 Difference]: Start difference. First operand 7296 states and 19835 transitions. Second operand 6 states. [2019-12-07 20:53:42,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:53:42,624 INFO L93 Difference]: Finished difference Result 7953 states and 21383 transitions. [2019-12-07 20:53:42,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 20:53:42,624 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-12-07 20:53:42,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:53:42,631 INFO L225 Difference]: With dead ends: 7953 [2019-12-07 20:53:42,631 INFO L226 Difference]: Without dead ends: 7953 [2019-12-07 20:53:42,632 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:53:42,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7953 states. [2019-12-07 20:53:42,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7953 to 7466. [2019-12-07 20:53:42,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7466 states. [2019-12-07 20:53:42,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7466 states to 7466 states and 20190 transitions. [2019-12-07 20:53:42,711 INFO L78 Accepts]: Start accepts. Automaton has 7466 states and 20190 transitions. Word has length 62 [2019-12-07 20:53:42,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:53:42,711 INFO L462 AbstractCegarLoop]: Abstraction has 7466 states and 20190 transitions. [2019-12-07 20:53:42,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:53:42,711 INFO L276 IsEmpty]: Start isEmpty. Operand 7466 states and 20190 transitions. [2019-12-07 20:53:42,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 20:53:42,720 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:53:42,720 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 20:53:42,720 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:53:42,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:53:42,720 INFO L82 PathProgramCache]: Analyzing trace with hash 2085196129, now seen corresponding path program 2 times [2019-12-07 20:53:42,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:53:42,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138707516] [2019-12-07 20:53:42,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:53:42,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:53:42,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:53:42,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138707516] [2019-12-07 20:53:42,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:53:42,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 20:53:42,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764848081] [2019-12-07 20:53:42,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 20:53:42,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:53:42,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 20:53:42,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:53:42,800 INFO L87 Difference]: Start difference. First operand 7466 states and 20190 transitions. Second operand 6 states. [2019-12-07 20:53:43,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:53:43,106 INFO L93 Difference]: Finished difference Result 9707 states and 26056 transitions. [2019-12-07 20:53:43,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 20:53:43,107 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2019-12-07 20:53:43,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:53:43,116 INFO L225 Difference]: With dead ends: 9707 [2019-12-07 20:53:43,116 INFO L226 Difference]: Without dead ends: 9707 [2019-12-07 20:53:43,116 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-07 20:53:43,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9707 states. [2019-12-07 20:53:43,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9707 to 7812. [2019-12-07 20:53:43,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7812 states. [2019-12-07 20:53:43,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7812 states to 7812 states and 21115 transitions. [2019-12-07 20:53:43,226 INFO L78 Accepts]: Start accepts. Automaton has 7812 states and 21115 transitions. Word has length 62 [2019-12-07 20:53:43,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:53:43,227 INFO L462 AbstractCegarLoop]: Abstraction has 7812 states and 21115 transitions. [2019-12-07 20:53:43,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 20:53:43,227 INFO L276 IsEmpty]: Start isEmpty. Operand 7812 states and 21115 transitions. [2019-12-07 20:53:43,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 20:53:43,236 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:53:43,236 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 20:53:43,236 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:53:43,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:53:43,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1867726925, now seen corresponding path program 3 times [2019-12-07 20:53:43,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:53:43,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352803138] [2019-12-07 20:53:43,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:53:43,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:53:43,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:53:43,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352803138] [2019-12-07 20:53:43,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:53:43,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:53:43,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138807077] [2019-12-07 20:53:43,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:53:43,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:53:43,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:53:43,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:53:43,280 INFO L87 Difference]: Start difference. First operand 7812 states and 21115 transitions. Second operand 5 states. [2019-12-07 20:53:43,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:53:43,493 INFO L93 Difference]: Finished difference Result 9677 states and 25623 transitions. [2019-12-07 20:53:43,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 20:53:43,493 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2019-12-07 20:53:43,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:53:43,504 INFO L225 Difference]: With dead ends: 9677 [2019-12-07 20:53:43,504 INFO L226 Difference]: Without dead ends: 9677 [2019-12-07 20:53:43,504 INFO L630 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-12-07 20:53:43,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9677 states. [2019-12-07 20:53:43,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9677 to 8382. [2019-12-07 20:53:43,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8382 states. [2019-12-07 20:53:43,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8382 states to 8382 states and 22522 transitions. [2019-12-07 20:53:43,610 INFO L78 Accepts]: Start accepts. Automaton has 8382 states and 22522 transitions. Word has length 62 [2019-12-07 20:53:43,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:53:43,610 INFO L462 AbstractCegarLoop]: Abstraction has 8382 states and 22522 transitions. [2019-12-07 20:53:43,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:53:43,611 INFO L276 IsEmpty]: Start isEmpty. Operand 8382 states and 22522 transitions. [2019-12-07 20:53:43,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 20:53:43,619 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:53:43,620 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 20:53:43,620 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:53:43,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:53:43,620 INFO L82 PathProgramCache]: Analyzing trace with hash -390801364, now seen corresponding path program 1 times [2019-12-07 20:53:43,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:53:43,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130157281] [2019-12-07 20:53:43,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:53:43,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:53:43,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:53:43,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130157281] [2019-12-07 20:53:43,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:53:43,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:53:43,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161777950] [2019-12-07 20:53:43,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:53:43,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:53:43,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:53:43,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:53:43,721 INFO L87 Difference]: Start difference. First operand 8382 states and 22522 transitions. Second operand 5 states. [2019-12-07 20:53:43,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:53:43,763 INFO L93 Difference]: Finished difference Result 9252 states and 24402 transitions. [2019-12-07 20:53:43,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:53:43,764 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-12-07 20:53:43,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:53:43,769 INFO L225 Difference]: With dead ends: 9252 [2019-12-07 20:53:43,769 INFO L226 Difference]: Without dead ends: 5057 [2019-12-07 20:53:43,769 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:53:43,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5057 states. [2019-12-07 20:53:43,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5057 to 5057. [2019-12-07 20:53:43,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5057 states. [2019-12-07 20:53:43,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5057 states to 5057 states and 11904 transitions. [2019-12-07 20:53:43,821 INFO L78 Accepts]: Start accepts. Automaton has 5057 states and 11904 transitions. Word has length 63 [2019-12-07 20:53:43,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:53:43,821 INFO L462 AbstractCegarLoop]: Abstraction has 5057 states and 11904 transitions. [2019-12-07 20:53:43,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:53:43,821 INFO L276 IsEmpty]: Start isEmpty. Operand 5057 states and 11904 transitions. [2019-12-07 20:53:43,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 20:53:43,825 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:53:43,825 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 20:53:43,825 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:53:43,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:53:43,825 INFO L82 PathProgramCache]: Analyzing trace with hash 478203150, now seen corresponding path program 2 times [2019-12-07 20:53:43,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:53:43,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903555071] [2019-12-07 20:53:43,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:53:43,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:53:43,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:53:43,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903555071] [2019-12-07 20:53:43,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:53:43,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 20:53:43,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275563469] [2019-12-07 20:53:43,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 20:53:43,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:53:43,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 20:53:43,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 20:53:43,919 INFO L87 Difference]: Start difference. First operand 5057 states and 11904 transitions. Second operand 8 states. [2019-12-07 20:53:44,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:53:44,244 INFO L93 Difference]: Finished difference Result 9991 states and 24207 transitions. [2019-12-07 20:53:44,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 20:53:44,244 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-07 20:53:44,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:53:44,252 INFO L225 Difference]: With dead ends: 9991 [2019-12-07 20:53:44,252 INFO L226 Difference]: Without dead ends: 9273 [2019-12-07 20:53:44,252 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2019-12-07 20:53:44,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9273 states. [2019-12-07 20:53:44,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9273 to 6896. [2019-12-07 20:53:44,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6896 states. [2019-12-07 20:53:44,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6896 states to 6896 states and 16317 transitions. [2019-12-07 20:53:44,337 INFO L78 Accepts]: Start accepts. Automaton has 6896 states and 16317 transitions. Word has length 63 [2019-12-07 20:53:44,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:53:44,337 INFO L462 AbstractCegarLoop]: Abstraction has 6896 states and 16317 transitions. [2019-12-07 20:53:44,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 20:53:44,337 INFO L276 IsEmpty]: Start isEmpty. Operand 6896 states and 16317 transitions. [2019-12-07 20:53:44,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 20:53:44,342 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:53:44,342 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 20:53:44,342 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:53:44,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:53:44,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1049153716, now seen corresponding path program 3 times [2019-12-07 20:53:44,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:53:44,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708773544] [2019-12-07 20:53:44,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:53:44,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:53:44,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:53:44,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708773544] [2019-12-07 20:53:44,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:53:44,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 20:53:44,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392219928] [2019-12-07 20:53:44,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 20:53:44,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:53:44,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 20:53:44,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-07 20:53:44,436 INFO L87 Difference]: Start difference. First operand 6896 states and 16317 transitions. Second operand 9 states. [2019-12-07 20:53:44,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:53:44,773 INFO L93 Difference]: Finished difference Result 9343 states and 22127 transitions. [2019-12-07 20:53:44,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 20:53:44,773 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 63 [2019-12-07 20:53:44,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:53:44,780 INFO L225 Difference]: With dead ends: 9343 [2019-12-07 20:53:44,781 INFO L226 Difference]: Without dead ends: 8577 [2019-12-07 20:53:44,781 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2019-12-07 20:53:44,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8577 states. [2019-12-07 20:53:44,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8577 to 6496. [2019-12-07 20:53:44,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6496 states. [2019-12-07 20:53:44,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6496 states to 6496 states and 15421 transitions. [2019-12-07 20:53:44,856 INFO L78 Accepts]: Start accepts. Automaton has 6496 states and 15421 transitions. Word has length 63 [2019-12-07 20:53:44,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:53:44,856 INFO L462 AbstractCegarLoop]: Abstraction has 6496 states and 15421 transitions. [2019-12-07 20:53:44,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 20:53:44,857 INFO L276 IsEmpty]: Start isEmpty. Operand 6496 states and 15421 transitions. [2019-12-07 20:53:44,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 20:53:44,861 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:53:44,861 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 20:53:44,862 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:53:44,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:53:44,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1104226676, now seen corresponding path program 4 times [2019-12-07 20:53:44,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:53:44,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571340374] [2019-12-07 20:53:44,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:53:44,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:53:44,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:53:44,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571340374] [2019-12-07 20:53:44,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:53:44,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:53:44,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025854478] [2019-12-07 20:53:44,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 20:53:44,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:53:44,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 20:53:44,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:53:44,939 INFO L87 Difference]: Start difference. First operand 6496 states and 15421 transitions. Second operand 5 states. [2019-12-07 20:53:44,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:53:44,976 INFO L93 Difference]: Finished difference Result 7014 states and 16517 transitions. [2019-12-07 20:53:44,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:53:44,976 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-12-07 20:53:44,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:53:44,977 INFO L225 Difference]: With dead ends: 7014 [2019-12-07 20:53:44,977 INFO L226 Difference]: Without dead ends: 592 [2019-12-07 20:53:44,977 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 20:53:44,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-12-07 20:53:44,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2019-12-07 20:53:44,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-12-07 20:53:44,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 1201 transitions. [2019-12-07 20:53:44,982 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 1201 transitions. Word has length 63 [2019-12-07 20:53:44,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:53:44,982 INFO L462 AbstractCegarLoop]: Abstraction has 592 states and 1201 transitions. [2019-12-07 20:53:44,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 20:53:44,983 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 1201 transitions. [2019-12-07 20:53:44,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 20:53:44,983 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:53:44,983 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 20:53:44,983 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:53:44,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:53:44,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1862642384, now seen corresponding path program 5 times [2019-12-07 20:53:44,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:53:44,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082146899] [2019-12-07 20:53:44,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:53:45,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:53:45,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:53:45,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082146899] [2019-12-07 20:53:45,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:53:45,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 20:53:45,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223272850] [2019-12-07 20:53:45,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 20:53:45,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:53:45,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 20:53:45,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-07 20:53:45,155 INFO L87 Difference]: Start difference. First operand 592 states and 1201 transitions. Second operand 12 states. [2019-12-07 20:53:45,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:53:45,581 INFO L93 Difference]: Finished difference Result 1095 states and 2204 transitions. [2019-12-07 20:53:45,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 20:53:45,582 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2019-12-07 20:53:45,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:53:45,582 INFO L225 Difference]: With dead ends: 1095 [2019-12-07 20:53:45,583 INFO L226 Difference]: Without dead ends: 772 [2019-12-07 20:53:45,583 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2019-12-07 20:53:45,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2019-12-07 20:53:45,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 616. [2019-12-07 20:53:45,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2019-12-07 20:53:45,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 1246 transitions. [2019-12-07 20:53:45,588 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 1246 transitions. Word has length 63 [2019-12-07 20:53:45,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:53:45,588 INFO L462 AbstractCegarLoop]: Abstraction has 616 states and 1246 transitions. [2019-12-07 20:53:45,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 20:53:45,588 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 1246 transitions. [2019-12-07 20:53:45,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 20:53:45,589 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:53:45,589 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 20:53:45,589 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:53:45,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:53:45,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1992733266, now seen corresponding path program 6 times [2019-12-07 20:53:45,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:53:45,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551853126] [2019-12-07 20:53:45,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:53:45,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 20:53:45,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 20:53:45,692 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 20:53:45,692 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 20:53:45,695 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1035] [1035] ULTIMATE.startENTRY-->L845: Formula: (let ((.cse0 (store |v_#valid_169| 0 0))) (and (= v_~z$r_buff1_thd0~0_270 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff0_thd0~0_139 0) (= 0 v_~__unbuffered_p1_EBX~0_131) (= v_~z$r_buff0_thd2~0_393 0) (= v_~z$w_buff1~0_325 0) (= v_~z$r_buff1_thd2~0_390 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t59~0.base_132|) 0) (= 0 v_~__unbuffered_p0_EAX~0_92) (= 0 v_~__unbuffered_p2_EAX~0_113) (= v_~x~0_15 0) (< 0 |v_#StackHeapBarrier_16|) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t59~0.base_132| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t59~0.base_132|) |v_ULTIMATE.start_main_~#t59~0.offset_73| 0)) |v_#memory_int_23|) (= v_~y~0_54 0) (= v_~__unbuffered_p0_EBX~0_92 0) (= v_~main$tmp_guard1~0_91 0) (= v_~main$tmp_guard0~0_23 0) (= 0 v_~z$r_buff1_thd3~0_325) (= 0 v_~weak$$choice0~0_184) (= v_~__unbuffered_p1_EAX~0_121 0) (= v_~z$read_delayed_var~0.base_6 0) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t59~0.base_132|) (= v_~__unbuffered_cnt~0_117 0) (= v_~a~0_20 0) (= 0 |v_#NULL.base_4|) (= v_~z$w_buff1_used~0_648 0) (= v_~z$r_buff0_thd1~0_76 0) (= v_~weak$$choice2~0_263 0) (= v_~z$w_buff0_used~0_1001 0) (= v_~z$read_delayed~0_7 0) (= v_~__unbuffered_p2_EBX~0_94 0) (= |v_#NULL.offset_4| 0) (= 0 v_~z$flush_delayed~0_244) (= v_~z$w_buff0~0_523 0) (= 0 v_~z$mem_tmp~0_199) (= (store .cse0 |v_ULTIMATE.start_main_~#t59~0.base_132| 1) |v_#valid_167|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t59~0.base_132| 4)) (= 0 v_~z$r_buff0_thd3~0_497) (= v_~z~0_324 0) (= |v_ULTIMATE.start_main_~#t59~0.offset_73| 0) (= v_~z$r_buff1_thd1~0_146 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_169|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_21|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_390, #NULL.offset=|v_#NULL.offset_4|, ~a~0=v_~a~0_20, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_139, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_92, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_121, ULTIMATE.start_main_~#t61~0.base=|v_ULTIMATE.start_main_~#t61~0.base_56|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_113, ~z$mem_tmp~0=v_~z$mem_tmp~0_199, ULTIMATE.start_main_~#t60~0.offset=|v_ULTIMATE.start_main_~#t60~0.offset_35|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_94, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_92, ULTIMATE.start_main_~#t59~0.base=|v_ULTIMATE.start_main_~#t59~0.base_132|, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_45|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_648, ~z$flush_delayed~0=v_~z$flush_delayed~0_244, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_181|, ~weak$$choice0~0=v_~weak$$choice0~0_184, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_277|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_146, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_497, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_117, ~x~0=v_~x~0_15, ULTIMATE.start_main_~#t60~0.base=|v_ULTIMATE.start_main_~#t60~0.base_94|, ULTIMATE.start_main_~#t59~0.offset=|v_ULTIMATE.start_main_~#t59~0.offset_73|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_9|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_325, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_91, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t61~0.offset=|v_ULTIMATE.start_main_~#t61~0.offset_34|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_270, ~y~0=v_~y~0_54, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_393, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_131, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1001, ~z$w_buff0~0=v_~z$w_buff0~0_523, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_325, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_57|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_33|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_159|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_75|, #valid=|v_#valid_167|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_324, ~weak$$choice2~0=v_~weak$$choice2~0_263, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_76} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t61~0.base, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_~#t60~0.offset, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t59~0.base, ULTIMATE.start_main_#t~ite58, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t60~0.base, ULTIMATE.start_main_~#t59~0.offset, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t61~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 20:53:45,696 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L845-1-->L847: Formula: (and (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t60~0.base_10| 4)) (not (= |v_ULTIMATE.start_main_~#t60~0.base_10| 0)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t60~0.base_10|)) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t60~0.base_10| 1) |v_#valid_31|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t60~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t60~0.base_10|) |v_ULTIMATE.start_main_~#t60~0.offset_9| 1)) |v_#memory_int_13|) (= 0 |v_ULTIMATE.start_main_~#t60~0.offset_9|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t60~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t60~0.base=|v_ULTIMATE.start_main_~#t60~0.base_10|, ULTIMATE.start_main_~#t60~0.offset=|v_ULTIMATE.start_main_~#t60~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_4|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t60~0.base, ULTIMATE.start_main_~#t60~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 20:53:45,697 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [999] [999] L847-1-->L849: Formula: (and (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t61~0.base_11| 1)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t61~0.base_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t61~0.base_11| 4)) (= (select |v_#valid_36| |v_ULTIMATE.start_main_~#t61~0.base_11|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t61~0.base_11|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t61~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t61~0.base_11|) |v_ULTIMATE.start_main_~#t61~0.offset_9| 2)) |v_#memory_int_15|) (= 0 |v_ULTIMATE.start_main_~#t61~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t61~0.offset=|v_ULTIMATE.start_main_~#t61~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_4|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t61~0.base=|v_ULTIMATE.start_main_~#t61~0.base_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t61~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t61~0.base, #length] because there is no mapped edge [2019-12-07 20:53:45,698 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L4-->L807: Formula: (and (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_14)) (= v_~z$mem_tmp~0_15 v_~z~0_26) (= v_~weak$$choice2~0_39 v_~z$flush_delayed~0_19) (= v_~z$r_buff0_thd3~0_61 1) (= |v_P2Thread1of1ForFork0_#t~nondet27_12| v_~weak$$choice2~0_39) (= v_~z$r_buff1_thd1~0_7 v_~z$r_buff0_thd1~0_7) (= v_~z$r_buff0_thd0~0_18 v_~z$r_buff1_thd0~0_14) (= v_~z$r_buff0_thd2~0_52 v_~z$r_buff1_thd2~0_31) (= |v_P2Thread1of1ForFork0_#t~nondet26_12| v_~weak$$choice0~0_12) (= v_~z$r_buff0_thd3~0_62 v_~z$r_buff1_thd3~0_38)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, P2Thread1of1ForFork0_#t~nondet27=|v_P2Thread1of1ForFork0_#t~nondet27_12|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_62, ~z~0=v_~z~0_26, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_52, P2Thread1of1ForFork0_#t~nondet26=|v_P2Thread1of1ForFork0_#t~nondet26_12|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_14} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_15, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_38, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_31, P2Thread1of1ForFork0_#t~nondet27=|v_P2Thread1of1ForFork0_#t~nondet27_11|, ~z$flush_delayed~0=v_~z$flush_delayed~0_19, P2Thread1of1ForFork0_#t~nondet26=|v_P2Thread1of1ForFork0_#t~nondet26_11|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_14, ~weak$$choice0~0=v_~weak$$choice0~0_12, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_14, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_61, ~z~0=v_~z~0_26, ~weak$$choice2~0=v_~weak$$choice2~0_39, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_52} AuxVars[] AssignedVars[~z$mem_tmp~0, ~weak$$choice0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, P2Thread1of1ForFork0_#t~nondet27, ~z$r_buff0_thd3~0, ~z$flush_delayed~0, ~weak$$choice2~0, P2Thread1of1ForFork0_#t~nondet26] because there is no mapped edge [2019-12-07 20:53:45,699 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [976] [976] L807-2-->L807-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork0_#t~ite28_Out-568458530| |P2Thread1of1ForFork0_#t~ite29_Out-568458530|)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-568458530 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-568458530 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite28_Out-568458530| ~z$w_buff0~0_In-568458530) (not .cse1) (not .cse2)) (and .cse0 (or .cse1 .cse2) (= |P2Thread1of1ForFork0_#t~ite28_Out-568458530| ~z$w_buff1~0_In-568458530)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-568458530, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-568458530, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-568458530, ~z$w_buff1~0=~z$w_buff1~0_In-568458530} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-568458530|, ~z$w_buff0~0=~z$w_buff0~0_In-568458530, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-568458530, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-568458530, ~z$w_buff1~0=~z$w_buff1~0_In-568458530, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-568458530|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 20:53:45,706 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L812-->L813: Formula: (and (= v_~z$r_buff0_thd3~0_204 v_~z$r_buff0_thd3~0_203) (not (= 0 (mod v_~weak$$choice2~0_108 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_204, ~weak$$choice2~0=v_~weak$$choice2~0_108} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_7|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_203, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_9|, ~weak$$choice2~0=v_~weak$$choice2~0_108} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 20:53:45,707 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [970] [970] L815-->L815-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-867474276 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite48_Out-867474276| ~z~0_In-867474276)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite48_Out-867474276| ~z$mem_tmp~0_In-867474276)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-867474276, ~z$flush_delayed~0=~z$flush_delayed~0_In-867474276, ~z~0=~z~0_In-867474276} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out-867474276|, ~z$mem_tmp~0=~z$mem_tmp~0_In-867474276, ~z$flush_delayed~0=~z$flush_delayed~0_In-867474276, ~z~0=~z~0_In-867474276} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 20:53:45,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] P0ENTRY-->P0EXIT: Formula: (and (= v_~x~0_10 1) (= v_~a~0_15 1) (= v_P0Thread1of1ForFork1_~arg.base_7 |v_P0Thread1of1ForFork1_#in~arg.base_9|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~__unbuffered_p0_EBX~0_21 v_~y~0_43) (= v_P0Thread1of1ForFork1_~arg.offset_7 |v_P0Thread1of1ForFork1_#in~arg.offset_9|) (= v_~x~0_10 v_~__unbuffered_p0_EAX~0_21) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_93 1) v_~__unbuffered_cnt~0_92)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|, ~y~0=v_~y~0_43} OutVars{~a~0=v_~a~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_21, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_92, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|, ~y~0=v_~y~0_43, ~x~0=v_~x~0_10, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_7} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 20:53:45,712 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L823-->L823-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1534801702 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1534801702 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite51_Out-1534801702| ~z$w_buff0_used~0_In-1534801702)) (and (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite51_Out-1534801702|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1534801702, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1534801702} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1534801702, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1534801702, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out-1534801702|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-07 20:53:45,723 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [961] [961] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-326230907 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite25_Out-326230907| ~z$mem_tmp~0_In-326230907)) (and (= ~z~0_In-326230907 |P1Thread1of1ForFork2_#t~ite25_Out-326230907|) .cse0))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-326230907, ~z$flush_delayed~0=~z$flush_delayed~0_In-326230907, ~z~0=~z~0_In-326230907} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-326230907, ~z$flush_delayed~0=~z$flush_delayed~0_In-326230907, ~z~0=~z~0_In-326230907, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out-326230907|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 20:53:45,723 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1008] [1008] L778-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 v_~z$flush_delayed~0_227) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_111 1) v_~__unbuffered_cnt~0_110) (= v_~z~0_219 |v_P1Thread1of1ForFork2_#t~ite25_86|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_86|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_110, ~z$flush_delayed~0=v_~z$flush_delayed~0_227, ~z~0=v_~z~0_219, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_85|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 20:53:45,723 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] L824-->L824-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-16718594 256))) (.cse2 (= (mod ~z$r_buff1_thd3~0_In-16718594 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-16718594 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-16718594 256)))) (or (and (= ~z$w_buff1_used~0_In-16718594 |P2Thread1of1ForFork0_#t~ite52_Out-16718594|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork0_#t~ite52_Out-16718594| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-16718594, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-16718594, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-16718594, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-16718594} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-16718594, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-16718594, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-16718594, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out-16718594|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-16718594} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-07 20:53:45,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L825-->L826: Formula: (let ((.cse0 (= ~z$r_buff0_thd3~0_In-1135406532 ~z$r_buff0_thd3~0_Out-1135406532)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1135406532 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1135406532 256)))) (or (and .cse0 .cse1) (and .cse2 .cse0) (and (not .cse2) (= ~z$r_buff0_thd3~0_Out-1135406532 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1135406532, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1135406532} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1135406532, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out-1135406532, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out-1135406532|} AuxVars[] AssignedVars[~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-07 20:53:45,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L826-->L826-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1702994248 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In1702994248 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd3~0_In1702994248 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In1702994248 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite54_Out1702994248|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd3~0_In1702994248 |P2Thread1of1ForFork0_#t~ite54_Out1702994248|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1702994248, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1702994248, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1702994248, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1702994248} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1702994248, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out1702994248|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1702994248, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1702994248, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1702994248} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 20:53:45,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L826-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= v_~z$r_buff1_thd3~0_141 |v_P2Thread1of1ForFork0_#t~ite54_28|) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0) (= v_~__unbuffered_cnt~0_77 (+ v_~__unbuffered_cnt~0_78 1))) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_27|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_141, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 20:53:45,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L849-1-->L855: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_35) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 20:53:45,725 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L855-2-->L855-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite59_Out622200665| |ULTIMATE.start_main_#t~ite58_Out622200665|)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In622200665 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In622200665 256) 0))) (or (and .cse0 (or .cse1 .cse2) (= |ULTIMATE.start_main_#t~ite58_Out622200665| ~z~0_In622200665)) (and .cse0 (not .cse2) (= |ULTIMATE.start_main_#t~ite58_Out622200665| ~z$w_buff1~0_In622200665) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In622200665, ~z$w_buff1_used~0=~z$w_buff1_used~0_In622200665, ~z$w_buff1~0=~z$w_buff1~0_In622200665, ~z~0=~z~0_In622200665} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In622200665, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out622200665|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In622200665, ~z$w_buff1~0=~z$w_buff1~0_In622200665, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out622200665|, ~z~0=~z~0_In622200665} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 20:53:45,726 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [968] [968] L856-->L856-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-2118572726 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-2118572726 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-2118572726 |ULTIMATE.start_main_#t~ite60_Out-2118572726|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite60_Out-2118572726|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2118572726, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2118572726} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-2118572726|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2118572726, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2118572726} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 20:53:45,727 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [959] [959] L857-->L857-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In1121019478 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1121019478 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1121019478 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In1121019478 256)))) (or (and (= ~z$w_buff1_used~0_In1121019478 |ULTIMATE.start_main_#t~ite61_Out1121019478|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite61_Out1121019478|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1121019478, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1121019478, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1121019478, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1121019478} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1121019478, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out1121019478|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1121019478, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1121019478, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1121019478} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 20:53:45,728 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L858-->L858-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1428526832 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In1428526832 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite62_Out1428526832| 0)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In1428526832 |ULTIMATE.start_main_#t~ite62_Out1428526832|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1428526832, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1428526832} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1428526832|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1428526832, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1428526832} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 20:53:45,729 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L859-->L859-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1263613994 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1263613994 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-1263613994 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-1263613994 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite63_Out-1263613994|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In-1263613994 |ULTIMATE.start_main_#t~ite63_Out-1263613994|) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1263613994, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1263613994, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1263613994, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1263613994} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-1263613994|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1263613994, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1263613994, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1263613994, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1263613994} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 20:53:45,730 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] L859-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~z$r_buff1_thd0~0_203 |v_ULTIMATE.start_main_#t~ite63_52|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_24 256)) (= v_~main$tmp_guard1~0_24 (ite (= 0 (ite (not (and (= v_~__unbuffered_p0_EBX~0_28 0) (= 1 v_~__unbuffered_p0_EAX~0_28) (= 1 v_~__unbuffered_p1_EAX~0_51) (= v_~__unbuffered_p1_EBX~0_49 0) (= v_~__unbuffered_p2_EBX~0_27 0) (= 1 v_~__unbuffered_p2_EAX~0_34))) 1 0)) 0 1))) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_52|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_28, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_28, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_49, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_51, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_51|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_28, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_20, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_28, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_49, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_51, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_203, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 20:53:45,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 08:53:45 BasicIcfg [2019-12-07 20:53:45,798 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 20:53:45,798 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 20:53:45,798 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 20:53:45,798 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 20:53:45,799 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:53:26" (3/4) ... [2019-12-07 20:53:45,801 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 20:53:45,801 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1035] [1035] ULTIMATE.startENTRY-->L845: Formula: (let ((.cse0 (store |v_#valid_169| 0 0))) (and (= v_~z$r_buff1_thd0~0_270 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff0_thd0~0_139 0) (= 0 v_~__unbuffered_p1_EBX~0_131) (= v_~z$r_buff0_thd2~0_393 0) (= v_~z$w_buff1~0_325 0) (= v_~z$r_buff1_thd2~0_390 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t59~0.base_132|) 0) (= 0 v_~__unbuffered_p0_EAX~0_92) (= 0 v_~__unbuffered_p2_EAX~0_113) (= v_~x~0_15 0) (< 0 |v_#StackHeapBarrier_16|) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t59~0.base_132| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t59~0.base_132|) |v_ULTIMATE.start_main_~#t59~0.offset_73| 0)) |v_#memory_int_23|) (= v_~y~0_54 0) (= v_~__unbuffered_p0_EBX~0_92 0) (= v_~main$tmp_guard1~0_91 0) (= v_~main$tmp_guard0~0_23 0) (= 0 v_~z$r_buff1_thd3~0_325) (= 0 v_~weak$$choice0~0_184) (= v_~__unbuffered_p1_EAX~0_121 0) (= v_~z$read_delayed_var~0.base_6 0) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t59~0.base_132|) (= v_~__unbuffered_cnt~0_117 0) (= v_~a~0_20 0) (= 0 |v_#NULL.base_4|) (= v_~z$w_buff1_used~0_648 0) (= v_~z$r_buff0_thd1~0_76 0) (= v_~weak$$choice2~0_263 0) (= v_~z$w_buff0_used~0_1001 0) (= v_~z$read_delayed~0_7 0) (= v_~__unbuffered_p2_EBX~0_94 0) (= |v_#NULL.offset_4| 0) (= 0 v_~z$flush_delayed~0_244) (= v_~z$w_buff0~0_523 0) (= 0 v_~z$mem_tmp~0_199) (= (store .cse0 |v_ULTIMATE.start_main_~#t59~0.base_132| 1) |v_#valid_167|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t59~0.base_132| 4)) (= 0 v_~z$r_buff0_thd3~0_497) (= v_~z~0_324 0) (= |v_ULTIMATE.start_main_~#t59~0.offset_73| 0) (= v_~z$r_buff1_thd1~0_146 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_169|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_21|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_9|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_390, #NULL.offset=|v_#NULL.offset_4|, ~a~0=v_~a~0_20, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_139, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_92, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_121, ULTIMATE.start_main_~#t61~0.base=|v_ULTIMATE.start_main_~#t61~0.base_56|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_113, ~z$mem_tmp~0=v_~z$mem_tmp~0_199, ULTIMATE.start_main_~#t60~0.offset=|v_ULTIMATE.start_main_~#t60~0.offset_35|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_94, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_92, ULTIMATE.start_main_~#t59~0.base=|v_ULTIMATE.start_main_~#t59~0.base_132|, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_45|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_648, ~z$flush_delayed~0=v_~z$flush_delayed~0_244, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_181|, ~weak$$choice0~0=v_~weak$$choice0~0_184, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_277|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_146, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_497, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_117, ~x~0=v_~x~0_15, ULTIMATE.start_main_~#t60~0.base=|v_ULTIMATE.start_main_~#t60~0.base_94|, ULTIMATE.start_main_~#t59~0.offset=|v_ULTIMATE.start_main_~#t59~0.offset_73|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_9|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_325, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_91, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t61~0.offset=|v_ULTIMATE.start_main_~#t61~0.offset_34|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_270, ~y~0=v_~y~0_54, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_393, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_131, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1001, ~z$w_buff0~0=v_~z$w_buff0~0_523, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_325, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_57|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_33|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_159|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_75|, #valid=|v_#valid_167|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_324, ~weak$$choice2~0=v_~weak$$choice2~0_263, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_76} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t61~0.base, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_~#t60~0.offset, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t59~0.base, ULTIMATE.start_main_#t~ite58, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t60~0.base, ULTIMATE.start_main_~#t59~0.offset, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t61~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 20:53:45,802 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L845-1-->L847: Formula: (and (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t60~0.base_10| 4)) (not (= |v_ULTIMATE.start_main_~#t60~0.base_10| 0)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t60~0.base_10|)) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t60~0.base_10| 1) |v_#valid_31|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t60~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t60~0.base_10|) |v_ULTIMATE.start_main_~#t60~0.offset_9| 1)) |v_#memory_int_13|) (= 0 |v_ULTIMATE.start_main_~#t60~0.offset_9|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t60~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t60~0.base=|v_ULTIMATE.start_main_~#t60~0.base_10|, ULTIMATE.start_main_~#t60~0.offset=|v_ULTIMATE.start_main_~#t60~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_4|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t60~0.base, ULTIMATE.start_main_~#t60~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 20:53:45,802 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [999] [999] L847-1-->L849: Formula: (and (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t61~0.base_11| 1)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t61~0.base_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t61~0.base_11| 4)) (= (select |v_#valid_36| |v_ULTIMATE.start_main_~#t61~0.base_11|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t61~0.base_11|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t61~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t61~0.base_11|) |v_ULTIMATE.start_main_~#t61~0.offset_9| 2)) |v_#memory_int_15|) (= 0 |v_ULTIMATE.start_main_~#t61~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t61~0.offset=|v_ULTIMATE.start_main_~#t61~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_4|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t61~0.base=|v_ULTIMATE.start_main_~#t61~0.base_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t61~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t61~0.base, #length] because there is no mapped edge [2019-12-07 20:53:45,803 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L4-->L807: Formula: (and (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_14)) (= v_~z$mem_tmp~0_15 v_~z~0_26) (= v_~weak$$choice2~0_39 v_~z$flush_delayed~0_19) (= v_~z$r_buff0_thd3~0_61 1) (= |v_P2Thread1of1ForFork0_#t~nondet27_12| v_~weak$$choice2~0_39) (= v_~z$r_buff1_thd1~0_7 v_~z$r_buff0_thd1~0_7) (= v_~z$r_buff0_thd0~0_18 v_~z$r_buff1_thd0~0_14) (= v_~z$r_buff0_thd2~0_52 v_~z$r_buff1_thd2~0_31) (= |v_P2Thread1of1ForFork0_#t~nondet26_12| v_~weak$$choice0~0_12) (= v_~z$r_buff0_thd3~0_62 v_~z$r_buff1_thd3~0_38)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, P2Thread1of1ForFork0_#t~nondet27=|v_P2Thread1of1ForFork0_#t~nondet27_12|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_62, ~z~0=v_~z~0_26, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_52, P2Thread1of1ForFork0_#t~nondet26=|v_P2Thread1of1ForFork0_#t~nondet26_12|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_14} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_15, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_38, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_31, P2Thread1of1ForFork0_#t~nondet27=|v_P2Thread1of1ForFork0_#t~nondet27_11|, ~z$flush_delayed~0=v_~z$flush_delayed~0_19, P2Thread1of1ForFork0_#t~nondet26=|v_P2Thread1of1ForFork0_#t~nondet26_11|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_14, ~weak$$choice0~0=v_~weak$$choice0~0_12, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_14, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_61, ~z~0=v_~z~0_26, ~weak$$choice2~0=v_~weak$$choice2~0_39, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_52} AuxVars[] AssignedVars[~z$mem_tmp~0, ~weak$$choice0~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, P2Thread1of1ForFork0_#t~nondet27, ~z$r_buff0_thd3~0, ~z$flush_delayed~0, ~weak$$choice2~0, P2Thread1of1ForFork0_#t~nondet26] because there is no mapped edge [2019-12-07 20:53:45,803 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [976] [976] L807-2-->L807-5: Formula: (let ((.cse0 (= |P2Thread1of1ForFork0_#t~ite28_Out-568458530| |P2Thread1of1ForFork0_#t~ite29_Out-568458530|)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-568458530 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-568458530 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite28_Out-568458530| ~z$w_buff0~0_In-568458530) (not .cse1) (not .cse2)) (and .cse0 (or .cse1 .cse2) (= |P2Thread1of1ForFork0_#t~ite28_Out-568458530| ~z$w_buff1~0_In-568458530)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-568458530, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-568458530, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-568458530, ~z$w_buff1~0=~z$w_buff1~0_In-568458530} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-568458530|, ~z$w_buff0~0=~z$w_buff0~0_In-568458530, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-568458530, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-568458530, ~z$w_buff1~0=~z$w_buff1~0_In-568458530, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-568458530|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 20:53:45,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L812-->L813: Formula: (and (= v_~z$r_buff0_thd3~0_204 v_~z$r_buff0_thd3~0_203) (not (= 0 (mod v_~weak$$choice2~0_108 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_204, ~weak$$choice2~0=v_~weak$$choice2~0_108} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_7|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_203, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_9|, ~weak$$choice2~0=v_~weak$$choice2~0_108} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 20:53:45,807 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [970] [970] L815-->L815-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-867474276 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite48_Out-867474276| ~z~0_In-867474276)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite48_Out-867474276| ~z$mem_tmp~0_In-867474276)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-867474276, ~z$flush_delayed~0=~z$flush_delayed~0_In-867474276, ~z~0=~z~0_In-867474276} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out-867474276|, ~z$mem_tmp~0=~z$mem_tmp~0_In-867474276, ~z$flush_delayed~0=~z$flush_delayed~0_In-867474276, ~z~0=~z~0_In-867474276} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 20:53:45,808 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] P0ENTRY-->P0EXIT: Formula: (and (= v_~x~0_10 1) (= v_~a~0_15 1) (= v_P0Thread1of1ForFork1_~arg.base_7 |v_P0Thread1of1ForFork1_#in~arg.base_9|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~__unbuffered_p0_EBX~0_21 v_~y~0_43) (= v_P0Thread1of1ForFork1_~arg.offset_7 |v_P0Thread1of1ForFork1_#in~arg.offset_9|) (= v_~x~0_10 v_~__unbuffered_p0_EAX~0_21) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_93 1) v_~__unbuffered_cnt~0_92)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|, ~y~0=v_~y~0_43} OutVars{~a~0=v_~a~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_21, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_92, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|, ~y~0=v_~y~0_43, ~x~0=v_~x~0_10, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_7} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 20:53:45,809 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L823-->L823-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1534801702 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1534801702 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite51_Out-1534801702| ~z$w_buff0_used~0_In-1534801702)) (and (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite51_Out-1534801702|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1534801702, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1534801702} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1534801702, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1534801702, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out-1534801702|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-07 20:53:45,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [961] [961] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-326230907 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite25_Out-326230907| ~z$mem_tmp~0_In-326230907)) (and (= ~z~0_In-326230907 |P1Thread1of1ForFork2_#t~ite25_Out-326230907|) .cse0))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-326230907, ~z$flush_delayed~0=~z$flush_delayed~0_In-326230907, ~z~0=~z~0_In-326230907} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-326230907, ~z$flush_delayed~0=~z$flush_delayed~0_In-326230907, ~z~0=~z~0_In-326230907, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out-326230907|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 20:53:45,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1008] [1008] L778-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 v_~z$flush_delayed~0_227) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_111 1) v_~__unbuffered_cnt~0_110) (= v_~z~0_219 |v_P1Thread1of1ForFork2_#t~ite25_86|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_86|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_110, ~z$flush_delayed~0=v_~z$flush_delayed~0_227, ~z~0=v_~z~0_219, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_85|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 20:53:45,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] L824-->L824-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-16718594 256))) (.cse2 (= (mod ~z$r_buff1_thd3~0_In-16718594 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-16718594 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-16718594 256)))) (or (and (= ~z$w_buff1_used~0_In-16718594 |P2Thread1of1ForFork0_#t~ite52_Out-16718594|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork0_#t~ite52_Out-16718594| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-16718594, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-16718594, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-16718594, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-16718594} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-16718594, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-16718594, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-16718594, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out-16718594|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-16718594} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-07 20:53:45,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L825-->L826: Formula: (let ((.cse0 (= ~z$r_buff0_thd3~0_In-1135406532 ~z$r_buff0_thd3~0_Out-1135406532)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1135406532 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1135406532 256)))) (or (and .cse0 .cse1) (and .cse2 .cse0) (and (not .cse2) (= ~z$r_buff0_thd3~0_Out-1135406532 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1135406532, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1135406532} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1135406532, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out-1135406532, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out-1135406532|} AuxVars[] AssignedVars[~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-07 20:53:45,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L826-->L826-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1702994248 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In1702994248 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd3~0_In1702994248 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In1702994248 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite54_Out1702994248|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd3~0_In1702994248 |P2Thread1of1ForFork0_#t~ite54_Out1702994248|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1702994248, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1702994248, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1702994248, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1702994248} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1702994248, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out1702994248|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1702994248, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1702994248, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1702994248} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 20:53:45,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L826-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= v_~z$r_buff1_thd3~0_141 |v_P2Thread1of1ForFork0_#t~ite54_28|) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0) (= v_~__unbuffered_cnt~0_77 (+ v_~__unbuffered_cnt~0_78 1))) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_27|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_141, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 20:53:45,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L849-1-->L855: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_35) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 20:53:45,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L855-2-->L855-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite59_Out622200665| |ULTIMATE.start_main_#t~ite58_Out622200665|)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In622200665 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In622200665 256) 0))) (or (and .cse0 (or .cse1 .cse2) (= |ULTIMATE.start_main_#t~ite58_Out622200665| ~z~0_In622200665)) (and .cse0 (not .cse2) (= |ULTIMATE.start_main_#t~ite58_Out622200665| ~z$w_buff1~0_In622200665) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In622200665, ~z$w_buff1_used~0=~z$w_buff1_used~0_In622200665, ~z$w_buff1~0=~z$w_buff1~0_In622200665, ~z~0=~z~0_In622200665} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In622200665, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out622200665|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In622200665, ~z$w_buff1~0=~z$w_buff1~0_In622200665, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out622200665|, ~z~0=~z~0_In622200665} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 20:53:45,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [968] [968] L856-->L856-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-2118572726 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-2118572726 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-2118572726 |ULTIMATE.start_main_#t~ite60_Out-2118572726|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite60_Out-2118572726|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2118572726, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2118572726} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-2118572726|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2118572726, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2118572726} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 20:53:45,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [959] [959] L857-->L857-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In1121019478 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1121019478 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1121019478 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In1121019478 256)))) (or (and (= ~z$w_buff1_used~0_In1121019478 |ULTIMATE.start_main_#t~ite61_Out1121019478|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite61_Out1121019478|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1121019478, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1121019478, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1121019478, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1121019478} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1121019478, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out1121019478|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1121019478, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1121019478, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1121019478} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 20:53:45,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L858-->L858-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1428526832 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In1428526832 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite62_Out1428526832| 0)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In1428526832 |ULTIMATE.start_main_#t~ite62_Out1428526832|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1428526832, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1428526832} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1428526832|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1428526832, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1428526832} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 20:53:45,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L859-->L859-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1263613994 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1263613994 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-1263613994 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-1263613994 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite63_Out-1263613994|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In-1263613994 |ULTIMATE.start_main_#t~ite63_Out-1263613994|) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1263613994, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1263613994, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1263613994, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1263613994} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-1263613994|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1263613994, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1263613994, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1263613994, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1263613994} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 20:53:45,818 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] L859-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~z$r_buff1_thd0~0_203 |v_ULTIMATE.start_main_#t~ite63_52|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_24 256)) (= v_~main$tmp_guard1~0_24 (ite (= 0 (ite (not (and (= v_~__unbuffered_p0_EBX~0_28 0) (= 1 v_~__unbuffered_p0_EAX~0_28) (= 1 v_~__unbuffered_p1_EAX~0_51) (= v_~__unbuffered_p1_EBX~0_49 0) (= v_~__unbuffered_p2_EBX~0_27 0) (= 1 v_~__unbuffered_p2_EAX~0_34))) 1 0)) 0 1))) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_52|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_28, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_28, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_49, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_51, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_51|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_28, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_20, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_28, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_49, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_51, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_203, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 20:53:45,891 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_fd14a807-32f6-4a35-876d-de9f26cda4d3/bin/utaipan/witness.graphml [2019-12-07 20:53:45,891 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 20:53:45,892 INFO L168 Benchmark]: Toolchain (without parser) took 20497.67 ms. Allocated memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: 1.3 GB). Free memory was 934.4 MB in the beginning and 927.2 MB in the end (delta: 7.2 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-12-07 20:53:45,893 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:53:45,893 INFO L168 Benchmark]: CACSL2BoogieTranslator took 410.57 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 934.4 MB in the beginning and 1.1 GB in the end (delta: -132.2 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 20:53:45,893 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.39 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:53:45,894 INFO L168 Benchmark]: Boogie Preprocessor took 26.73 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 20:53:45,894 INFO L168 Benchmark]: RCFGBuilder took 450.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 999.6 MB in the end (delta: 61.6 MB). Peak memory consumption was 61.6 MB. Max. memory is 11.5 GB. [2019-12-07 20:53:45,895 INFO L168 Benchmark]: TraceAbstraction took 19474.10 ms. Allocated memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: 1.2 GB). Free memory was 999.6 MB in the beginning and 959.3 MB in the end (delta: 40.3 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-12-07 20:53:45,895 INFO L168 Benchmark]: Witness Printer took 92.98 ms. Allocated memory is still 2.3 GB. Free memory was 959.3 MB in the beginning and 927.2 MB in the end (delta: 32.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 11.5 GB. [2019-12-07 20:53:45,897 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 410.57 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 934.4 MB in the beginning and 1.1 GB in the end (delta: -132.2 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.39 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.73 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 450.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 999.6 MB in the end (delta: 61.6 MB). Peak memory consumption was 61.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 19474.10 ms. Allocated memory was 1.1 GB in the beginning and 2.3 GB in the end (delta: 1.2 GB). Free memory was 999.6 MB in the beginning and 959.3 MB in the end (delta: 40.3 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. * Witness Printer took 92.98 ms. Allocated memory is still 2.3 GB. Free memory was 959.3 MB in the beginning and 927.2 MB in the end (delta: 32.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 198 ProgramPointsBefore, 105 ProgramPointsAfterwards, 244 TransitionsBefore, 127 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 58 ConcurrentYvCompositions, 28 ChoiceCompositions, 9655 VarBasedMoverChecksPositive, 318 VarBasedMoverChecksNegative, 83 SemBasedMoverChecksPositive, 339 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 139722 CheckedPairsTotal, 132 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L845] FCALL, FORK 0 pthread_create(&t59, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t60, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] FCALL, FORK 0 pthread_create(&t61, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$w_buff1 = z$w_buff0 [L792] 3 z$w_buff0 = 1 [L793] 3 z$w_buff1_used = z$w_buff0_used [L794] 3 z$w_buff0_used = (_Bool)1 [L807] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L807] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L808] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L808] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L809] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L810] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L810] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L811] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L813] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L815] 3 z = z$flush_delayed ? z$mem_tmp : z [L816] 3 z$flush_delayed = (_Bool)0 [L819] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 y = 1 [L763] 2 __unbuffered_p1_EAX = y [L766] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L767] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L768] 2 z$flush_delayed = weak$$choice2 [L769] 2 z$mem_tmp = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L823] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L770] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L771] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L772] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L773] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L774] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L775] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L776] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L776] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L777] 2 __unbuffered_p1_EBX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L824] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L855] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L856] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L857] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L858] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 189 locations, 2 error locations. Result: UNSAFE, OverallTime: 19.2s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4095 SDtfs, 4166 SDslu, 8873 SDs, 0 SdLazy, 3110 SolverSat, 189 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 158 GetRequests, 42 SyntacticMatches, 9 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57368occurred 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: 6.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 25408 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 892 NumberOfCodeBlocks, 892 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 809 ConstructedInterpolants, 0 QuantifiedInterpolants, 245097 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...