./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix003_rmo.opt.0.1.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_ebd20d66-a81e-4ee7-a845-2db306f1904b/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ebd20d66-a81e-4ee7-a845-2db306f1904b/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ebd20d66-a81e-4ee7-a845-2db306f1904b/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ebd20d66-a81e-4ee7-a845-2db306f1904b/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix003_rmo.opt.0.1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_ebd20d66-a81e-4ee7-a845-2db306f1904b/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ebd20d66-a81e-4ee7-a845-2db306f1904b/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 f97215b77a1bd7df71e4ae7d3185ce4378ba6f6b ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 13:44:24,890 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 13:44:24,892 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 13:44:24,903 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 13:44:24,903 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 13:44:24,904 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 13:44:24,905 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 13:44:24,907 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 13:44:24,909 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 13:44:24,910 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 13:44:24,911 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 13:44:24,912 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 13:44:24,912 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 13:44:24,913 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 13:44:24,914 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 13:44:24,915 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 13:44:24,916 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 13:44:24,917 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 13:44:24,918 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 13:44:24,920 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 13:44:24,922 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 13:44:24,923 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 13:44:24,923 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 13:44:24,924 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 13:44:24,926 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 13:44:24,926 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 13:44:24,927 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 13:44:24,927 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 13:44:24,927 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 13:44:24,928 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 13:44:24,928 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 13:44:24,929 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 13:44:24,929 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 13:44:24,930 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 13:44:24,931 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 13:44:24,931 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 13:44:24,931 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 13:44:24,932 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 13:44:24,932 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 13:44:24,932 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 13:44:24,933 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 13:44:24,933 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ebd20d66-a81e-4ee7-a845-2db306f1904b/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 13:44:24,945 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 13:44:24,945 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 13:44:24,946 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 13:44:24,946 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 13:44:24,946 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 13:44:24,946 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 13:44:24,946 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 13:44:24,946 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 13:44:24,946 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 13:44:24,947 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 13:44:24,947 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 13:44:24,947 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 13:44:24,947 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 13:44:24,947 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 13:44:24,947 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 13:44:24,948 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 13:44:24,948 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 13:44:24,948 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 13:44:24,948 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 13:44:24,948 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 13:44:24,949 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 13:44:24,949 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 13:44:24,949 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 13:44:24,949 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 13:44:24,949 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 13:44:24,949 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 13:44:24,949 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 13:44:24,950 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 13:44:24,950 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 13:44:24,950 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 13:44:24,950 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 13:44:24,950 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:44:24,950 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 13:44:24,950 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 13:44:24,951 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 13:44:24,951 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 13:44:24,951 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 13:44:24,951 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 13:44:24,951 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 13:44:24,951 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 13:44:24,952 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_ebd20d66-a81e-4ee7-a845-2db306f1904b/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 -> f97215b77a1bd7df71e4ae7d3185ce4378ba6f6b [2019-12-07 13:44:25,062 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 13:44:25,072 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 13:44:25,075 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 13:44:25,076 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 13:44:25,076 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 13:44:25,077 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ebd20d66-a81e-4ee7-a845-2db306f1904b/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix003_rmo.opt.0.1.i [2019-12-07 13:44:25,123 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ebd20d66-a81e-4ee7-a845-2db306f1904b/bin/utaipan/data/cd54e47b0/5c4d32cee3454859948dc7743c75d4b4/FLAG62525cc36 [2019-12-07 13:44:25,557 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 13:44:25,557 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ebd20d66-a81e-4ee7-a845-2db306f1904b/sv-benchmarks/c/pthread-wmm/mix003_rmo.opt.0.1.i [2019-12-07 13:44:25,567 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ebd20d66-a81e-4ee7-a845-2db306f1904b/bin/utaipan/data/cd54e47b0/5c4d32cee3454859948dc7743c75d4b4/FLAG62525cc36 [2019-12-07 13:44:25,899 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ebd20d66-a81e-4ee7-a845-2db306f1904b/bin/utaipan/data/cd54e47b0/5c4d32cee3454859948dc7743c75d4b4 [2019-12-07 13:44:25,904 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 13:44:25,906 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 13:44:25,908 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 13:44:25,908 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 13:44:25,913 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 13:44:25,914 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:44:25" (1/1) ... [2019-12-07 13:44:25,917 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b9f35de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:44:25, skipping insertion in model container [2019-12-07 13:44:25,917 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:44:25" (1/1) ... [2019-12-07 13:44:25,921 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 13:44:25,956 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 13:44:26,222 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:44:26,231 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 13:44:26,275 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:44:26,322 INFO L208 MainTranslator]: Completed translation [2019-12-07 13:44:26,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:44:26 WrapperNode [2019-12-07 13:44:26,323 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 13:44:26,323 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 13:44:26,323 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 13:44:26,323 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 13:44:26,329 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:44:26" (1/1) ... [2019-12-07 13:44:26,343 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:44:26" (1/1) ... [2019-12-07 13:44:26,363 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 13:44:26,363 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 13:44:26,363 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 13:44:26,363 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 13:44:26,369 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:44:26" (1/1) ... [2019-12-07 13:44:26,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:44:26" (1/1) ... [2019-12-07 13:44:26,373 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:44:26" (1/1) ... [2019-12-07 13:44:26,373 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:44:26" (1/1) ... [2019-12-07 13:44:26,381 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:44:26" (1/1) ... [2019-12-07 13:44:26,384 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:44:26" (1/1) ... [2019-12-07 13:44:26,387 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:44:26" (1/1) ... [2019-12-07 13:44:26,391 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 13:44:26,391 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 13:44:26,391 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 13:44:26,391 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 13:44:26,392 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:44:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ebd20d66-a81e-4ee7-a845-2db306f1904b/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 13:44:26,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 13:44:26,439 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 13:44:26,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 13:44:26,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 13:44:26,439 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 13:44:26,439 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 13:44:26,439 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 13:44:26,439 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 13:44:26,439 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 13:44:26,440 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 13:44:26,440 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 13:44:26,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 13:44:26,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 13:44:26,441 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 13:44:26,861 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 13:44:26,861 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 13:44:26,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:44:26 BoogieIcfgContainer [2019-12-07 13:44:26,862 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 13:44:26,862 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 13:44:26,862 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 13:44:26,864 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 13:44:26,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:44:25" (1/3) ... [2019-12-07 13:44:26,865 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f29f7d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:44:26, skipping insertion in model container [2019-12-07 13:44:26,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:44:26" (2/3) ... [2019-12-07 13:44:26,865 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f29f7d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:44:26, skipping insertion in model container [2019-12-07 13:44:26,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:44:26" (3/3) ... [2019-12-07 13:44:26,866 INFO L109 eAbstractionObserver]: Analyzing ICFG mix003_rmo.opt.0.1.i [2019-12-07 13:44:26,872 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 13:44:26,872 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 13:44:26,877 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 13:44:26,877 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 13:44:26,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,904 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,904 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,905 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,906 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,908 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,909 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,910 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,914 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,915 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,916 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,917 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,918 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,922 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,922 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,922 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,922 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,922 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,929 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,930 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:44:26,953 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 13:44:26,965 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 13:44:26,965 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 13:44:26,965 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 13:44:26,965 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 13:44:26,965 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 13:44:26,965 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 13:44:26,965 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 13:44:26,965 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 13:44:26,975 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 196 places, 242 transitions [2019-12-07 13:44:26,976 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 196 places, 242 transitions [2019-12-07 13:44:27,037 INFO L134 PetriNetUnfolder]: 56/239 cut-off events. [2019-12-07 13:44:27,038 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 13:44:27,050 INFO L76 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 239 events. 56/239 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 923 event pairs. 9/190 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 13:44:27,071 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 196 places, 242 transitions [2019-12-07 13:44:27,110 INFO L134 PetriNetUnfolder]: 56/239 cut-off events. [2019-12-07 13:44:27,110 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 13:44:27,118 INFO L76 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 239 events. 56/239 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 923 event pairs. 9/190 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 13:44:27,142 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-07 13:44:27,143 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 13:44:30,609 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-07 13:44:30,887 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-12-07 13:44:31,008 INFO L206 etLargeBlockEncoding]: Checked pairs total: 122986 [2019-12-07 13:44:31,008 INFO L214 etLargeBlockEncoding]: Total number of compositions: 129 [2019-12-07 13:44:31,010 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 104 places, 126 transitions [2019-12-07 13:44:33,465 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 40454 states. [2019-12-07 13:44:33,466 INFO L276 IsEmpty]: Start isEmpty. Operand 40454 states. [2019-12-07 13:44:33,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 13:44:33,471 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:33,471 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:44:33,471 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 13:44:33,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:33,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1566960600, now seen corresponding path program 1 times [2019-12-07 13:44:33,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:44:33,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922042138] [2019-12-07 13:44:33,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:33,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:33,624 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 13:44:33,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922042138] [2019-12-07 13:44:33,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:33,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 13:44:33,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799411985] [2019-12-07 13:44:33,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:44:33,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:44:33,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:44:33,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:44:33,639 INFO L87 Difference]: Start difference. First operand 40454 states. Second operand 3 states. [2019-12-07 13:44:34,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:34,074 INFO L93 Difference]: Finished difference Result 40170 states and 165810 transitions. [2019-12-07 13:44:34,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:44:34,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 13:44:34,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:34,306 INFO L225 Difference]: With dead ends: 40170 [2019-12-07 13:44:34,306 INFO L226 Difference]: Without dead ends: 37418 [2019-12-07 13:44:34,307 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 13:44:34,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37418 states. [2019-12-07 13:44:35,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37418 to 37418. [2019-12-07 13:44:35,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37418 states. [2019-12-07 13:44:35,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37418 states to 37418 states and 154336 transitions. [2019-12-07 13:44:35,599 INFO L78 Accepts]: Start accepts. Automaton has 37418 states and 154336 transitions. Word has length 7 [2019-12-07 13:44:35,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:35,600 INFO L462 AbstractCegarLoop]: Abstraction has 37418 states and 154336 transitions. [2019-12-07 13:44:35,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:44:35,600 INFO L276 IsEmpty]: Start isEmpty. Operand 37418 states and 154336 transitions. [2019-12-07 13:44:35,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 13:44:35,605 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:35,605 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:44:35,605 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 13:44:35,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:35,606 INFO L82 PathProgramCache]: Analyzing trace with hash 91372485, now seen corresponding path program 1 times [2019-12-07 13:44:35,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:44:35,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397161031] [2019-12-07 13:44:35,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:35,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:35,668 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 13:44:35,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397161031] [2019-12-07 13:44:35,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:35,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:44:35,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019080988] [2019-12-07 13:44:35,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:44:35,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:44:35,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:44:35,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:44:35,671 INFO L87 Difference]: Start difference. First operand 37418 states and 154336 transitions. Second operand 4 states. [2019-12-07 13:44:36,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:36,185 INFO L93 Difference]: Finished difference Result 59622 states and 235954 transitions. [2019-12-07 13:44:36,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:44:36,186 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 13:44:36,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:36,618 INFO L225 Difference]: With dead ends: 59622 [2019-12-07 13:44:36,618 INFO L226 Difference]: Without dead ends: 59592 [2019-12-07 13:44:36,619 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 13:44:37,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59592 states. [2019-12-07 13:44:38,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59592 to 57946. [2019-12-07 13:44:38,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57946 states. [2019-12-07 13:44:38,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57946 states to 57946 states and 230764 transitions. [2019-12-07 13:44:38,163 INFO L78 Accepts]: Start accepts. Automaton has 57946 states and 230764 transitions. Word has length 13 [2019-12-07 13:44:38,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:38,163 INFO L462 AbstractCegarLoop]: Abstraction has 57946 states and 230764 transitions. [2019-12-07 13:44:38,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:44:38,163 INFO L276 IsEmpty]: Start isEmpty. Operand 57946 states and 230764 transitions. [2019-12-07 13:44:38,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 13:44:38,167 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:38,167 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:44:38,167 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 13:44:38,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:38,168 INFO L82 PathProgramCache]: Analyzing trace with hash 922617190, now seen corresponding path program 1 times [2019-12-07 13:44:38,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:44:38,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175584839] [2019-12-07 13:44:38,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:38,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:38,211 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 13:44:38,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175584839] [2019-12-07 13:44:38,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:38,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:44:38,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101828823] [2019-12-07 13:44:38,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:44:38,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:44:38,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:44:38,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:44:38,212 INFO L87 Difference]: Start difference. First operand 57946 states and 230764 transitions. Second operand 4 states. [2019-12-07 13:44:38,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:38,640 INFO L93 Difference]: Finished difference Result 74942 states and 293732 transitions. [2019-12-07 13:44:38,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:44:38,641 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 13:44:38,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:39,874 INFO L225 Difference]: With dead ends: 74942 [2019-12-07 13:44:39,874 INFO L226 Difference]: Without dead ends: 74914 [2019-12-07 13:44:39,874 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 13:44:40,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74914 states. [2019-12-07 13:44:41,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74914 to 66466. [2019-12-07 13:44:41,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66466 states. [2019-12-07 13:44:41,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66466 states to 66466 states and 263234 transitions. [2019-12-07 13:44:41,457 INFO L78 Accepts]: Start accepts. Automaton has 66466 states and 263234 transitions. Word has length 16 [2019-12-07 13:44:41,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:41,458 INFO L462 AbstractCegarLoop]: Abstraction has 66466 states and 263234 transitions. [2019-12-07 13:44:41,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:44:41,458 INFO L276 IsEmpty]: Start isEmpty. Operand 66466 states and 263234 transitions. [2019-12-07 13:44:41,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 13:44:41,463 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:41,464 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:44:41,464 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 13:44:41,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:41,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1378288655, now seen corresponding path program 1 times [2019-12-07 13:44:41,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:44:41,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769894452] [2019-12-07 13:44:41,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:41,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:41,524 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 13:44:41,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769894452] [2019-12-07 13:44:41,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:41,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 13:44:41,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423027940] [2019-12-07 13:44:41,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:44:41,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:44:41,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:44:41,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:44:41,526 INFO L87 Difference]: Start difference. First operand 66466 states and 263234 transitions. Second operand 3 states. [2019-12-07 13:44:41,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:41,789 INFO L93 Difference]: Finished difference Result 66488 states and 263147 transitions. [2019-12-07 13:44:41,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:44:41,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 13:44:41,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:41,933 INFO L225 Difference]: With dead ends: 66488 [2019-12-07 13:44:41,933 INFO L226 Difference]: Without dead ends: 66488 [2019-12-07 13:44:41,933 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 13:44:42,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66488 states. [2019-12-07 13:44:43,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66488 to 66405. [2019-12-07 13:44:43,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66405 states. [2019-12-07 13:44:43,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66405 states to 66405 states and 262971 transitions. [2019-12-07 13:44:43,652 INFO L78 Accepts]: Start accepts. Automaton has 66405 states and 262971 transitions. Word has length 18 [2019-12-07 13:44:43,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:43,653 INFO L462 AbstractCegarLoop]: Abstraction has 66405 states and 262971 transitions. [2019-12-07 13:44:43,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:44:43,653 INFO L276 IsEmpty]: Start isEmpty. Operand 66405 states and 262971 transitions. [2019-12-07 13:44:43,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 13:44:43,659 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:43,659 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 13:44:43,659 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 13:44:43,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:43,659 INFO L82 PathProgramCache]: Analyzing trace with hash -2099876316, now seen corresponding path program 1 times [2019-12-07 13:44:43,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:44:43,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591397360] [2019-12-07 13:44:43,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:43,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:43,693 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 13:44:43,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591397360] [2019-12-07 13:44:43,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:43,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 13:44:43,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975375769] [2019-12-07 13:44:43,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:44:43,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:44:43,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:44:43,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:44:43,694 INFO L87 Difference]: Start difference. First operand 66405 states and 262971 transitions. Second operand 3 states. [2019-12-07 13:44:43,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:43,939 INFO L93 Difference]: Finished difference Result 62448 states and 246925 transitions. [2019-12-07 13:44:43,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:44:43,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 13:44:43,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:44,251 INFO L225 Difference]: With dead ends: 62448 [2019-12-07 13:44:44,252 INFO L226 Difference]: Without dead ends: 62448 [2019-12-07 13:44:44,252 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 13:44:44,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62448 states. [2019-12-07 13:44:45,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62448 to 62448. [2019-12-07 13:44:45,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62448 states. [2019-12-07 13:44:45,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62448 states to 62448 states and 246925 transitions. [2019-12-07 13:44:45,681 INFO L78 Accepts]: Start accepts. Automaton has 62448 states and 246925 transitions. Word has length 19 [2019-12-07 13:44:45,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:45,681 INFO L462 AbstractCegarLoop]: Abstraction has 62448 states and 246925 transitions. [2019-12-07 13:44:45,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:44:45,681 INFO L276 IsEmpty]: Start isEmpty. Operand 62448 states and 246925 transitions. [2019-12-07 13:44:45,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 13:44:45,692 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:45,692 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] [2019-12-07 13:44:45,692 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 13:44:45,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:45,692 INFO L82 PathProgramCache]: Analyzing trace with hash -984887103, now seen corresponding path program 1 times [2019-12-07 13:44:45,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:44:45,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092998440] [2019-12-07 13:44:45,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:45,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:45,729 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 13:44:45,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092998440] [2019-12-07 13:44:45,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:45,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:44:45,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303029496] [2019-12-07 13:44:45,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:44:45,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:44:45,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:44:45,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:44:45,731 INFO L87 Difference]: Start difference. First operand 62448 states and 246925 transitions. Second operand 5 states. [2019-12-07 13:44:46,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:46,447 INFO L93 Difference]: Finished difference Result 74976 states and 292167 transitions. [2019-12-07 13:44:46,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 13:44:46,448 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 13:44:46,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:46,608 INFO L225 Difference]: With dead ends: 74976 [2019-12-07 13:44:46,608 INFO L226 Difference]: Without dead ends: 74926 [2019-12-07 13:44:46,609 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 13:44:47,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74926 states. [2019-12-07 13:44:48,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74926 to 62038. [2019-12-07 13:44:48,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62038 states. [2019-12-07 13:44:48,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62038 states to 62038 states and 245466 transitions. [2019-12-07 13:44:48,205 INFO L78 Accepts]: Start accepts. Automaton has 62038 states and 245466 transitions. Word has length 22 [2019-12-07 13:44:48,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:48,205 INFO L462 AbstractCegarLoop]: Abstraction has 62038 states and 245466 transitions. [2019-12-07 13:44:48,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:44:48,205 INFO L276 IsEmpty]: Start isEmpty. Operand 62038 states and 245466 transitions. [2019-12-07 13:44:48,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 13:44:48,259 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:48,259 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] [2019-12-07 13:44:48,260 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 13:44:48,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:48,260 INFO L82 PathProgramCache]: Analyzing trace with hash 979582923, now seen corresponding path program 1 times [2019-12-07 13:44:48,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:44:48,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644892539] [2019-12-07 13:44:48,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:48,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:48,286 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 13:44:48,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644892539] [2019-12-07 13:44:48,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:48,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:44:48,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837739598] [2019-12-07 13:44:48,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:44:48,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:44:48,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:44:48,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:44:48,288 INFO L87 Difference]: Start difference. First operand 62038 states and 245466 transitions. Second operand 3 states. [2019-12-07 13:44:48,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:48,410 INFO L93 Difference]: Finished difference Result 34464 states and 119119 transitions. [2019-12-07 13:44:48,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:44:48,410 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-07 13:44:48,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:48,471 INFO L225 Difference]: With dead ends: 34464 [2019-12-07 13:44:48,471 INFO L226 Difference]: Without dead ends: 34464 [2019-12-07 13:44:48,471 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 13:44:48,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34464 states. [2019-12-07 13:44:49,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34464 to 34464. [2019-12-07 13:44:49,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34464 states. [2019-12-07 13:44:49,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34464 states to 34464 states and 119119 transitions. [2019-12-07 13:44:49,266 INFO L78 Accepts]: Start accepts. Automaton has 34464 states and 119119 transitions. Word has length 32 [2019-12-07 13:44:49,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:49,266 INFO L462 AbstractCegarLoop]: Abstraction has 34464 states and 119119 transitions. [2019-12-07 13:44:49,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:44:49,266 INFO L276 IsEmpty]: Start isEmpty. Operand 34464 states and 119119 transitions. [2019-12-07 13:44:49,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 13:44:49,292 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:49,292 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] [2019-12-07 13:44:49,292 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 13:44:49,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:49,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1849884344, now seen corresponding path program 1 times [2019-12-07 13:44:49,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:44:49,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323119372] [2019-12-07 13:44:49,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:49,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:49,332 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 13:44:49,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323119372] [2019-12-07 13:44:49,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:49,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:44:49,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847310699] [2019-12-07 13:44:49,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:44:49,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:44:49,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:44:49,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:44:49,333 INFO L87 Difference]: Start difference. First operand 34464 states and 119119 transitions. Second operand 3 states. [2019-12-07 13:44:49,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:49,443 INFO L93 Difference]: Finished difference Result 34464 states and 117625 transitions. [2019-12-07 13:44:49,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:44:49,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-07 13:44:49,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:49,499 INFO L225 Difference]: With dead ends: 34464 [2019-12-07 13:44:49,499 INFO L226 Difference]: Without dead ends: 34464 [2019-12-07 13:44:49,500 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 13:44:49,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34464 states. [2019-12-07 13:44:50,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34464 to 34331. [2019-12-07 13:44:50,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34331 states. [2019-12-07 13:44:50,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34331 states to 34331 states and 117256 transitions. [2019-12-07 13:44:50,196 INFO L78 Accepts]: Start accepts. Automaton has 34331 states and 117256 transitions. Word has length 33 [2019-12-07 13:44:50,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:50,196 INFO L462 AbstractCegarLoop]: Abstraction has 34331 states and 117256 transitions. [2019-12-07 13:44:50,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:44:50,196 INFO L276 IsEmpty]: Start isEmpty. Operand 34331 states and 117256 transitions. [2019-12-07 13:44:50,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 13:44:50,223 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:50,223 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 13:44:50,223 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 13:44:50,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:50,223 INFO L82 PathProgramCache]: Analyzing trace with hash -872055044, now seen corresponding path program 1 times [2019-12-07 13:44:50,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:44:50,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354412049] [2019-12-07 13:44:50,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:50,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:50,318 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 13:44:50,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354412049] [2019-12-07 13:44:50,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:50,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 13:44:50,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985710788] [2019-12-07 13:44:50,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 13:44:50,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:44:50,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 13:44:50,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2019-12-07 13:44:50,319 INFO L87 Difference]: Start difference. First operand 34331 states and 117256 transitions. Second operand 9 states. [2019-12-07 13:44:50,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:50,681 INFO L93 Difference]: Finished difference Result 35032 states and 119537 transitions. [2019-12-07 13:44:50,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 13:44:50,681 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2019-12-07 13:44:50,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:50,732 INFO L225 Difference]: With dead ends: 35032 [2019-12-07 13:44:50,732 INFO L226 Difference]: Without dead ends: 35032 [2019-12-07 13:44:50,733 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=73, Unknown=0, NotChecked=0, Total=132 [2019-12-07 13:44:51,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35032 states. [2019-12-07 13:44:51,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35032 to 34304. [2019-12-07 13:44:51,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34304 states. [2019-12-07 13:44:51,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34304 states to 34304 states and 117176 transitions. [2019-12-07 13:44:51,467 INFO L78 Accepts]: Start accepts. Automaton has 34304 states and 117176 transitions. Word has length 34 [2019-12-07 13:44:51,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:51,467 INFO L462 AbstractCegarLoop]: Abstraction has 34304 states and 117176 transitions. [2019-12-07 13:44:51,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 13:44:51,467 INFO L276 IsEmpty]: Start isEmpty. Operand 34304 states and 117176 transitions. [2019-12-07 13:44:51,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 13:44:51,488 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:51,488 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] [2019-12-07 13:44:51,488 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 13:44:51,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:51,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1112134865, now seen corresponding path program 1 times [2019-12-07 13:44:51,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:44:51,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494679634] [2019-12-07 13:44:51,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:51,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:51,540 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 13:44:51,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494679634] [2019-12-07 13:44:51,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:51,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:44:51,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38141281] [2019-12-07 13:44:51,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:44:51,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:44:51,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:44:51,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:44:51,541 INFO L87 Difference]: Start difference. First operand 34304 states and 117176 transitions. Second operand 5 states. [2019-12-07 13:44:51,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:51,736 INFO L93 Difference]: Finished difference Result 63697 states and 217736 transitions. [2019-12-07 13:44:51,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:44:51,737 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-12-07 13:44:51,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:51,786 INFO L225 Difference]: With dead ends: 63697 [2019-12-07 13:44:51,786 INFO L226 Difference]: Without dead ends: 34360 [2019-12-07 13:44:51,787 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 13:44:52,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34360 states. [2019-12-07 13:44:52,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34360 to 34304. [2019-12-07 13:44:52,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34304 states. [2019-12-07 13:44:52,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34304 states to 34304 states and 113901 transitions. [2019-12-07 13:44:52,464 INFO L78 Accepts]: Start accepts. Automaton has 34304 states and 113901 transitions. Word has length 35 [2019-12-07 13:44:52,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:52,464 INFO L462 AbstractCegarLoop]: Abstraction has 34304 states and 113901 transitions. [2019-12-07 13:44:52,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:44:52,464 INFO L276 IsEmpty]: Start isEmpty. Operand 34304 states and 113901 transitions. [2019-12-07 13:44:52,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 13:44:52,485 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:52,485 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] [2019-12-07 13:44:52,485 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 13:44:52,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:52,485 INFO L82 PathProgramCache]: Analyzing trace with hash 970782019, now seen corresponding path program 2 times [2019-12-07 13:44:52,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:44:52,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463479006] [2019-12-07 13:44:52,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:52,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:52,576 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 13:44:52,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463479006] [2019-12-07 13:44:52,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:52,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 13:44:52,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154639750] [2019-12-07 13:44:52,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:44:52,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:44:52,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:44:52,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:44:52,577 INFO L87 Difference]: Start difference. First operand 34304 states and 113901 transitions. Second operand 7 states. [2019-12-07 13:44:53,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:53,105 INFO L93 Difference]: Finished difference Result 48653 states and 161202 transitions. [2019-12-07 13:44:53,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 13:44:53,105 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-12-07 13:44:53,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:53,178 INFO L225 Difference]: With dead ends: 48653 [2019-12-07 13:44:53,178 INFO L226 Difference]: Without dead ends: 48653 [2019-12-07 13:44:53,178 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-12-07 13:44:53,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48653 states. [2019-12-07 13:44:54,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48653 to 43785. [2019-12-07 13:44:54,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43785 states. [2019-12-07 13:44:54,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43785 states to 43785 states and 145270 transitions. [2019-12-07 13:44:54,082 INFO L78 Accepts]: Start accepts. Automaton has 43785 states and 145270 transitions. Word has length 35 [2019-12-07 13:44:54,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:54,083 INFO L462 AbstractCegarLoop]: Abstraction has 43785 states and 145270 transitions. [2019-12-07 13:44:54,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 13:44:54,083 INFO L276 IsEmpty]: Start isEmpty. Operand 43785 states and 145270 transitions. [2019-12-07 13:44:54,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 13:44:54,113 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:54,113 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] [2019-12-07 13:44:54,113 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 13:44:54,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:54,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1935017073, now seen corresponding path program 3 times [2019-12-07 13:44:54,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:44:54,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806393489] [2019-12-07 13:44:54,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:54,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:54,186 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 13:44:54,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806393489] [2019-12-07 13:44:54,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:54,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 13:44:54,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302854269] [2019-12-07 13:44:54,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 13:44:54,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:44:54,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 13:44:54,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 13:44:54,188 INFO L87 Difference]: Start difference. First operand 43785 states and 145270 transitions. Second operand 8 states. [2019-12-07 13:44:54,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:54,937 INFO L93 Difference]: Finished difference Result 70533 states and 236970 transitions. [2019-12-07 13:44:54,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 13:44:54,938 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2019-12-07 13:44:54,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:55,047 INFO L225 Difference]: With dead ends: 70533 [2019-12-07 13:44:55,048 INFO L226 Difference]: Without dead ends: 64019 [2019-12-07 13:44:55,048 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2019-12-07 13:44:55,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64019 states. [2019-12-07 13:44:56,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64019 to 60612. [2019-12-07 13:44:56,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60612 states. [2019-12-07 13:44:56,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60612 states to 60612 states and 204100 transitions. [2019-12-07 13:44:56,228 INFO L78 Accepts]: Start accepts. Automaton has 60612 states and 204100 transitions. Word has length 35 [2019-12-07 13:44:56,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:56,228 INFO L462 AbstractCegarLoop]: Abstraction has 60612 states and 204100 transitions. [2019-12-07 13:44:56,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 13:44:56,228 INFO L276 IsEmpty]: Start isEmpty. Operand 60612 states and 204100 transitions. [2019-12-07 13:44:56,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 13:44:56,273 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:56,273 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 13:44:56,273 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 13:44:56,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:56,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1432823916, now seen corresponding path program 1 times [2019-12-07 13:44:56,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:44:56,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475327484] [2019-12-07 13:44:56,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:56,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:56,307 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 13:44:56,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475327484] [2019-12-07 13:44:56,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:56,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:44:56,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293462032] [2019-12-07 13:44:56,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:44:56,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:44:56,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:44:56,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:44:56,308 INFO L87 Difference]: Start difference. First operand 60612 states and 204100 transitions. Second operand 4 states. [2019-12-07 13:44:56,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:56,333 INFO L93 Difference]: Finished difference Result 6208 states and 15143 transitions. [2019-12-07 13:44:56,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:44:56,333 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-12-07 13:44:56,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:56,339 INFO L225 Difference]: With dead ends: 6208 [2019-12-07 13:44:56,339 INFO L226 Difference]: Without dead ends: 6208 [2019-12-07 13:44:56,339 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 13:44:56,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6208 states. [2019-12-07 13:44:56,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6208 to 6151. [2019-12-07 13:44:56,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6151 states. [2019-12-07 13:44:56,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6151 states to 6151 states and 15020 transitions. [2019-12-07 13:44:56,402 INFO L78 Accepts]: Start accepts. Automaton has 6151 states and 15020 transitions. Word has length 36 [2019-12-07 13:44:56,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:56,402 INFO L462 AbstractCegarLoop]: Abstraction has 6151 states and 15020 transitions. [2019-12-07 13:44:56,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:44:56,402 INFO L276 IsEmpty]: Start isEmpty. Operand 6151 states and 15020 transitions. [2019-12-07 13:44:56,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 13:44:56,406 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:56,406 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] [2019-12-07 13:44:56,406 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 13:44:56,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:56,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1963893031, now seen corresponding path program 1 times [2019-12-07 13:44:56,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:44:56,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517604989] [2019-12-07 13:44:56,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:56,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:56,443 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 13:44:56,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517604989] [2019-12-07 13:44:56,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:56,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:44:56,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585877870] [2019-12-07 13:44:56,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:44:56,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:44:56,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:44:56,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:44:56,444 INFO L87 Difference]: Start difference. First operand 6151 states and 15020 transitions. Second operand 5 states. [2019-12-07 13:44:56,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:56,468 INFO L93 Difference]: Finished difference Result 4491 states and 11242 transitions. [2019-12-07 13:44:56,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:44:56,468 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-12-07 13:44:56,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:56,471 INFO L225 Difference]: With dead ends: 4491 [2019-12-07 13:44:56,471 INFO L226 Difference]: Without dead ends: 2328 [2019-12-07 13:44:56,471 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 13:44:56,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2328 states. [2019-12-07 13:44:56,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2328 to 2271. [2019-12-07 13:44:56,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2271 states. [2019-12-07 13:44:56,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2271 states to 2271 states and 5646 transitions. [2019-12-07 13:44:56,504 INFO L78 Accepts]: Start accepts. Automaton has 2271 states and 5646 transitions. Word has length 47 [2019-12-07 13:44:56,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:56,505 INFO L462 AbstractCegarLoop]: Abstraction has 2271 states and 5646 transitions. [2019-12-07 13:44:56,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:44:56,505 INFO L276 IsEmpty]: Start isEmpty. Operand 2271 states and 5646 transitions. [2019-12-07 13:44:56,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 13:44:56,507 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:56,507 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 13:44:56,507 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 13:44:56,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:56,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1453951739, now seen corresponding path program 1 times [2019-12-07 13:44:56,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:44:56,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244133010] [2019-12-07 13:44:56,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:56,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:56,553 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 13:44:56,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244133010] [2019-12-07 13:44:56,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:56,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:44:56,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430570418] [2019-12-07 13:44:56,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:44:56,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:44:56,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:44:56,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:44:56,555 INFO L87 Difference]: Start difference. First operand 2271 states and 5646 transitions. Second operand 4 states. [2019-12-07 13:44:56,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:56,574 INFO L93 Difference]: Finished difference Result 2634 states and 6482 transitions. [2019-12-07 13:44:56,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:44:56,574 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-12-07 13:44:56,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:56,575 INFO L225 Difference]: With dead ends: 2634 [2019-12-07 13:44:56,575 INFO L226 Difference]: Without dead ends: 413 [2019-12-07 13:44:56,575 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 13:44:56,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2019-12-07 13:44:56,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2019-12-07 13:44:56,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-12-07 13:44:56,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 906 transitions. [2019-12-07 13:44:56,580 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 906 transitions. Word has length 62 [2019-12-07 13:44:56,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:56,581 INFO L462 AbstractCegarLoop]: Abstraction has 413 states and 906 transitions. [2019-12-07 13:44:56,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:44:56,581 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 906 transitions. [2019-12-07 13:44:56,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 13:44:56,582 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:56,582 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 13:44:56,582 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 13:44:56,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:56,582 INFO L82 PathProgramCache]: Analyzing trace with hash 2017033534, now seen corresponding path program 1 times [2019-12-07 13:44:56,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:44:56,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064425575] [2019-12-07 13:44:56,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:56,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:44:56,650 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 13:44:56,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064425575] [2019-12-07 13:44:56,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:44:56,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 13:44:56,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488756932] [2019-12-07 13:44:56,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 13:44:56,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:44:56,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 13:44:56,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 13:44:56,652 INFO L87 Difference]: Start difference. First operand 413 states and 906 transitions. Second operand 8 states. [2019-12-07 13:44:56,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:44:56,789 INFO L93 Difference]: Finished difference Result 748 states and 1618 transitions. [2019-12-07 13:44:56,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 13:44:56,789 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-07 13:44:56,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:44:56,790 INFO L225 Difference]: With dead ends: 748 [2019-12-07 13:44:56,790 INFO L226 Difference]: Without dead ends: 513 [2019-12-07 13:44:56,790 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-12-07 13:44:56,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2019-12-07 13:44:56,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 443. [2019-12-07 13:44:56,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2019-12-07 13:44:56,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 953 transitions. [2019-12-07 13:44:56,796 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 953 transitions. Word has length 63 [2019-12-07 13:44:56,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:44:56,796 INFO L462 AbstractCegarLoop]: Abstraction has 443 states and 953 transitions. [2019-12-07 13:44:56,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 13:44:56,796 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 953 transitions. [2019-12-07 13:44:56,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 13:44:56,797 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:44:56,797 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 13:44:56,797 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 13:44:56,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:44:56,798 INFO L82 PathProgramCache]: Analyzing trace with hash 455314750, now seen corresponding path program 2 times [2019-12-07 13:44:56,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:44:56,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972397165] [2019-12-07 13:44:56,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:44:56,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:44:56,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:44:56,893 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 13:44:56,893 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 13:44:56,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1027] [1027] ULTIMATE.startENTRY-->L838: Formula: (let ((.cse0 (store |v_#valid_71| 0 0))) (and (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t0~0.base_36| 4) |v_#length_19|) (= v_~y$mem_tmp~0_262 0) (= v_~y$w_buff0_used~0_977 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$flush_delayed~0_330 0) (= v_~z~0_24 0) (= v_~y$w_buff1~0_277 0) (= v_~y$r_buff0_thd0~0_202 0) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= 0 v_~y$r_buff1_thd3~0_391) (= v_~__unbuffered_p1_EBX~0_38 0) (< 0 |v_#StackHeapBarrier_16|) (= (store .cse0 |v_ULTIMATE.start_main_~#t0~0.base_36| 1) |v_#valid_69|) (= v_~y~0_354 0) (= 0 v_~__unbuffered_p2_EAX~0_39) (= v_~y$r_buff1_thd1~0_216 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t0~0.base_36| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t0~0.base_36|) |v_ULTIMATE.start_main_~#t0~0.offset_24| 0)) |v_#memory_int_19|) (= v_~x~0_48 0) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t0~0.base_36|) (= v_~__unbuffered_p2_EBX~0_35 0) (= 0 v_~weak$$choice0~0_248) (= 0 |v_#NULL.base_6|) (= 0 v_~__unbuffered_p1_EAX~0_57) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$r_buff1_thd0~0_275 0) (= v_~main$tmp_guard1~0_32 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t0~0.base_36|) 0) (= 0 v_~y$w_buff0~0_387) (= v_~weak$$choice2~0_323 0) (= v_~y$r_buff0_thd1~0_147 0) (= |v_ULTIMATE.start_main_~#t0~0.offset_24| 0) (= v_~__unbuffered_cnt~0_153 0) (= 0 v_~y$r_buff1_thd2~0_395) (= 0 v_~__unbuffered_p0_EAX~0_35) (= v_~main$tmp_guard0~0_24 0) (= v_~y$w_buff1_used~0_549 0) (= 0 v_~y$r_buff0_thd3~0_629) (= 0 v_~y$r_buff0_thd2~0_411))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_20|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_22|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t0~0.offset=|v_ULTIMATE.start_main_~#t0~0.offset_24|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_262, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_35, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_391, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_57, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_147, ~y$flush_delayed~0=v_~y$flush_delayed~0_330, #length=|v_#length_19|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_39, ULTIMATE.start_main_~#t2~0.base=|v_ULTIMATE.start_main_~#t2~0.base_18|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_35, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_56|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_56|, ~weak$$choice0~0=v_~weak$$choice0~0_248, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_44|, ~y$w_buff1~0=v_~y$w_buff1~0_277, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_411, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_153, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_275, ~x~0=v_~x~0_48, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_977, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_8|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_216, ~y$w_buff0~0=v_~y$w_buff0~0_387, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_629, ~y~0=v_~y~0_354, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_38, ULTIMATE.start_main_~#t2~0.offset=|v_ULTIMATE.start_main_~#t2~0.offset_15|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_76|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ULTIMATE.start_main_~#t0~0.base=|v_ULTIMATE.start_main_~#t0~0.base_36|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_28|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_395, ULTIMATE.start_main_~#t1~0.base=|v_ULTIMATE.start_main_~#t1~0.base_26|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_498|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_202, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_24, ~weak$$choice2~0=v_~weak$$choice2~0_323, ULTIMATE.start_main_~#t1~0.offset=|v_ULTIMATE.start_main_~#t1~0.offset_14|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_549} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, #NULL.offset, ULTIMATE.start_main_~#t0~0.offset, ~y$read_delayed~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2~0.base, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet56, ~main$tmp_guard1~0, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t2~0.offset, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t0~0.base, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_~#t1~0.base, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t1~0.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 13:44:56,896 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L838-1-->L840: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1~0.base_11|) |v_ULTIMATE.start_main_~#t1~0.offset_10| 1)) |v_#memory_int_15|) (= |v_ULTIMATE.start_main_~#t1~0.offset_10| 0) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1~0.base_11| 1)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1~0.base_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1~0.base_11| 4)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1~0.base_11|)) (not (= |v_ULTIMATE.start_main_~#t1~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1~0.base=|v_ULTIMATE.start_main_~#t1~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_15|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1~0.offset=|v_ULTIMATE.start_main_~#t1~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1~0.offset] because there is no mapped edge [2019-12-07 13:44:56,896 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L840-1-->L842: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t2~0.base_10|)) (= |v_ULTIMATE.start_main_~#t2~0.offset_9| 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2~0.base_10| 4)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2~0.base_10|) |v_ULTIMATE.start_main_~#t2~0.offset_9| 2)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2~0.base_10|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2~0.base_10| 1)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_4|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2~0.offset=|v_ULTIMATE.start_main_~#t2~0.offset_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2~0.base=|v_ULTIMATE.start_main_~#t2~0.base_10|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t2~0.offset, #length, ULTIMATE.start_main_~#t2~0.base] because there is no mapped edge [2019-12-07 13:44:56,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] P2ENTRY-->L4-3: Formula: (and (= v_~y$w_buff0~0_41 v_~y$w_buff1~0_28) (= (ite (not (and (not (= 0 (mod v_~y$w_buff1_used~0_70 256))) (not (= (mod v_~y$w_buff0_used~0_124 256) 0)))) 1 0) |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_11|) (= |v_P2Thread1of1ForFork0_#in~arg.offset_13| v_P2Thread1of1ForFork0_~arg.offset_11) (= v_~y$w_buff0_used~0_124 1) (= 1 v_~y$w_buff0~0_40) (= v_~y$w_buff1_used~0_70 v_~y$w_buff0_used~0_125) (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_13)) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_13 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_11|) (= |v_P2Thread1of1ForFork0_#in~arg.base_13| v_P2Thread1of1ForFork0_~arg.base_11)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_13|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_125, ~y$w_buff0~0=v_~y$w_buff0~0_41, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_13|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_11, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_13|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_11|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_124, ~y$w_buff1~0=v_~y$w_buff1~0_28, ~y$w_buff0~0=v_~y$w_buff0~0_40, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_11, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_13|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_13, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_70} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 13:44:56,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [967] [967] L797-2-->L797-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-767637240 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-767637240 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite28_Out-767637240| ~y$w_buff1~0_In-767637240)) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite28_Out-767637240| ~y$w_buff0~0_In-767637240) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-767637240, ~y$w_buff1~0=~y$w_buff1~0_In-767637240, ~y$w_buff0~0=~y$w_buff0~0_In-767637240, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-767637240} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-767637240|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-767637240, ~y$w_buff1~0=~y$w_buff1~0_In-767637240, ~y$w_buff0~0=~y$w_buff0~0_In-767637240, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-767637240} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 13:44:56,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [918] [918] L797-4-->L798: Formula: (= v_~y~0_67 |v_P2Thread1of1ForFork0_#t~ite28_6|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_6|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_5|, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_5|, ~y~0=v_~y~0_67} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29, ~y~0] because there is no mapped edge [2019-12-07 13:44:56,900 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [913] [913] L802-->L803: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_69 256))) (= v_~y$r_buff0_thd3~0_162 v_~y$r_buff0_thd3~0_161)) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_162, ~weak$$choice2~0=v_~weak$$choice2~0_69} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_8|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_10|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_161, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_11|, ~weak$$choice2~0=v_~weak$$choice2~0_69} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 13:44:56,901 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L805-->L805-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-1341247071 256)))) (or (and (not .cse0) (= ~y$mem_tmp~0_In-1341247071 |P2Thread1of1ForFork0_#t~ite48_Out-1341247071|)) (and .cse0 (= ~y~0_In-1341247071 |P2Thread1of1ForFork0_#t~ite48_Out-1341247071|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1341247071, ~y$flush_delayed~0=~y$flush_delayed~0_In-1341247071, ~y~0=~y~0_In-1341247071} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out-1341247071|, ~y$mem_tmp~0=~y$mem_tmp~0_In-1341247071, ~y$flush_delayed~0=~y$flush_delayed~0_In-1341247071, ~y~0=~y~0_In-1341247071} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 13:44:56,901 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [987] [987] P0ENTRY-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_100 1) v_~__unbuffered_cnt~0_99) (= |v_P0Thread1of1ForFork1_#in~arg.base_11| v_P0Thread1of1ForFork1_~arg.base_9) (= v_P0Thread1of1ForFork1_~arg.offset_9 |v_P0Thread1of1ForFork1_#in~arg.offset_11|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_7|) (= v_~x~0_40 v_~__unbuffered_p0_EAX~0_16) (= v_~z~0_14 1) (= 0 |v_P0Thread1of1ForFork1_#res.base_7|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_11|, ~x~0=v_~x~0_40} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_11|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_99, ~z~0=v_~z~0_14, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_11|, ~x~0=v_~x~0_40, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_9} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 13:44:56,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [968] [968] L813-->L813-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In889397801 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In889397801 256)))) (or (and (= ~y$w_buff0_used~0_In889397801 |P2Thread1of1ForFork0_#t~ite51_Out889397801|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite51_Out889397801| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In889397801, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In889397801} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In889397801, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In889397801, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out889397801|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-07 13:44:56,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L814-->L814-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In888784684 256))) (.cse0 (= (mod ~y$r_buff0_thd3~0_In888784684 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In888784684 256))) (.cse2 (= (mod ~y$r_buff1_thd3~0_In888784684 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite52_Out888784684| ~y$w_buff1_used~0_In888784684) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork0_#t~ite52_Out888784684|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In888784684, ~y$w_buff0_used~0=~y$w_buff0_used~0_In888784684, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In888784684, ~y$w_buff1_used~0=~y$w_buff1_used~0_In888784684} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In888784684, ~y$w_buff0_used~0=~y$w_buff0_used~0_In888784684, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In888784684, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out888784684|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In888784684} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-07 13:44:56,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L815-->L816: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1953696572 256))) (.cse0 (= ~y$r_buff0_thd3~0_Out1953696572 ~y$r_buff0_thd3~0_In1953696572)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1953696572 256)))) (or (and .cse0 .cse1) (and (not .cse1) (not .cse2) (= ~y$r_buff0_thd3~0_Out1953696572 0)) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1953696572, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1953696572} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1953696572, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out1953696572, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out1953696572|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-07 13:44:56,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [970] [970] L768-->L768-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-161235749 256)))) (or (and .cse0 (= |P1Thread1of1ForFork2_#t~ite25_Out-161235749| ~y~0_In-161235749)) (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite25_Out-161235749| ~y$mem_tmp~0_In-161235749)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-161235749, ~y$flush_delayed~0=~y$flush_delayed~0_In-161235749, ~y~0=~y~0_In-161235749} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-161235749, ~y$flush_delayed~0=~y$flush_delayed~0_In-161235749, ~y~0=~y~0_In-161235749, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out-161235749|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 13:44:56,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= v_~y~0_149 |v_P1Thread1of1ForFork2_#t~ite25_62|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1)) (= v_~y$flush_delayed~0_131 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_62|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~y$flush_delayed~0=v_~y$flush_delayed~0_131, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, ~y~0=v_~y~0_149, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_61|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 13:44:56,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [956] [956] L816-->L816-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In-108402390 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-108402390 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-108402390 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In-108402390 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd3~0_In-108402390 |P2Thread1of1ForFork0_#t~ite54_Out-108402390|) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite54_Out-108402390|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-108402390, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-108402390, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-108402390, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-108402390} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-108402390, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-108402390, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out-108402390|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-108402390, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-108402390} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 13:44:56,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L816-2-->P2EXIT: Formula: (and (= v_~y$r_buff1_thd3~0_174 |v_P2Thread1of1ForFork0_#t~ite54_30|) (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= (+ v_~__unbuffered_cnt~0_90 1) v_~__unbuffered_cnt~0_89) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_174, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_29|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 13:44:56,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [934] [934] L842-1-->L848: 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_51) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, ~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 13:44:56,909 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [957] [957] L848-2-->L848-5: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In1709881971 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite59_Out1709881971| |ULTIMATE.start_main_#t~ite58_Out1709881971|)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1709881971 256)))) (or (and (or .cse0 .cse1) (= ~y~0_In1709881971 |ULTIMATE.start_main_#t~ite58_Out1709881971|) .cse2) (and (not .cse0) .cse2 (not .cse1) (= ~y$w_buff1~0_In1709881971 |ULTIMATE.start_main_#t~ite58_Out1709881971|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1709881971, ~y~0=~y~0_In1709881971, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1709881971, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1709881971} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1709881971, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out1709881971|, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out1709881971|, ~y~0=~y~0_In1709881971, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1709881971, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1709881971} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 13:44:56,909 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [959] [959] L849-->L849-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In777229383 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In777229383 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite60_Out777229383|) (not .cse1)) (and (= ~y$w_buff0_used~0_In777229383 |ULTIMATE.start_main_#t~ite60_Out777229383|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In777229383, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In777229383} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out777229383|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In777229383, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In777229383} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 13:44:56,910 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [947] [947] L850-->L850-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-1739462987 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-1739462987 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-1739462987 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1739462987 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite61_Out-1739462987|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~y$w_buff1_used~0_In-1739462987 |ULTIMATE.start_main_#t~ite61_Out-1739462987|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1739462987, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1739462987, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1739462987, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1739462987} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1739462987|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1739462987, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1739462987, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1739462987, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1739462987} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 13:44:56,910 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [963] [963] L851-->L851-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-525121775 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-525121775 256) 0))) (or (and (= ~y$r_buff0_thd0~0_In-525121775 |ULTIMATE.start_main_#t~ite62_Out-525121775|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite62_Out-525121775|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-525121775, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-525121775} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-525121775|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-525121775, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-525121775} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 13:44:56,911 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [954] [954] L852-->L852-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1461504233 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1461504233 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1461504233 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-1461504233 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite63_Out-1461504233|)) (and (= |ULTIMATE.start_main_#t~ite63_Out-1461504233| ~y$r_buff1_thd0~0_In-1461504233) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1461504233, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1461504233, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1461504233, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1461504233} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-1461504233|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1461504233, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1461504233, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1461504233, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1461504233} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 13:44:56,911 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1022] [1022] L852-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p1_EAX~0_46) (= 1 v_~__unbuffered_p2_EAX~0_27) (= v_~__unbuffered_p1_EBX~0_26 0) (= 0 v_~__unbuffered_p0_EAX~0_24) (= v_~__unbuffered_p2_EBX~0_24 0))) 1 0)) 0 1) v_~main$tmp_guard1~0_21) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_~y$r_buff1_thd0~0_256 |v_ULTIMATE.start_main_#t~ite63_36|) (= (mod v_~main$tmp_guard1~0_21 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_36|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_24, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_26, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_46, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_27} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_35|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_24, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_26, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_46, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_27, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_256, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 13:44:56,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:44:56 BasicIcfg [2019-12-07 13:44:56,973 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 13:44:56,973 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 13:44:56,973 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 13:44:56,973 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 13:44:56,974 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:44:26" (3/4) ... [2019-12-07 13:44:56,975 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 13:44:56,976 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1027] [1027] ULTIMATE.startENTRY-->L838: Formula: (let ((.cse0 (store |v_#valid_71| 0 0))) (and (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t0~0.base_36| 4) |v_#length_19|) (= v_~y$mem_tmp~0_262 0) (= v_~y$w_buff0_used~0_977 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$flush_delayed~0_330 0) (= v_~z~0_24 0) (= v_~y$w_buff1~0_277 0) (= v_~y$r_buff0_thd0~0_202 0) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= 0 v_~y$r_buff1_thd3~0_391) (= v_~__unbuffered_p1_EBX~0_38 0) (< 0 |v_#StackHeapBarrier_16|) (= (store .cse0 |v_ULTIMATE.start_main_~#t0~0.base_36| 1) |v_#valid_69|) (= v_~y~0_354 0) (= 0 v_~__unbuffered_p2_EAX~0_39) (= v_~y$r_buff1_thd1~0_216 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t0~0.base_36| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t0~0.base_36|) |v_ULTIMATE.start_main_~#t0~0.offset_24| 0)) |v_#memory_int_19|) (= v_~x~0_48 0) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t0~0.base_36|) (= v_~__unbuffered_p2_EBX~0_35 0) (= 0 v_~weak$$choice0~0_248) (= 0 |v_#NULL.base_6|) (= 0 v_~__unbuffered_p1_EAX~0_57) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$r_buff1_thd0~0_275 0) (= v_~main$tmp_guard1~0_32 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t0~0.base_36|) 0) (= 0 v_~y$w_buff0~0_387) (= v_~weak$$choice2~0_323 0) (= v_~y$r_buff0_thd1~0_147 0) (= |v_ULTIMATE.start_main_~#t0~0.offset_24| 0) (= v_~__unbuffered_cnt~0_153 0) (= 0 v_~y$r_buff1_thd2~0_395) (= 0 v_~__unbuffered_p0_EAX~0_35) (= v_~main$tmp_guard0~0_24 0) (= v_~y$w_buff1_used~0_549 0) (= 0 v_~y$r_buff0_thd3~0_629) (= 0 v_~y$r_buff0_thd2~0_411))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_20|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_22|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t0~0.offset=|v_ULTIMATE.start_main_~#t0~0.offset_24|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_262, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_35, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_391, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_57, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_147, ~y$flush_delayed~0=v_~y$flush_delayed~0_330, #length=|v_#length_19|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_39, ULTIMATE.start_main_~#t2~0.base=|v_ULTIMATE.start_main_~#t2~0.base_18|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_35, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_56|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_56|, ~weak$$choice0~0=v_~weak$$choice0~0_248, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_44|, ~y$w_buff1~0=v_~y$w_buff1~0_277, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_411, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_153, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_275, ~x~0=v_~x~0_48, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_977, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_8|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_216, ~y$w_buff0~0=v_~y$w_buff0~0_387, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_629, ~y~0=v_~y~0_354, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_38, ULTIMATE.start_main_~#t2~0.offset=|v_ULTIMATE.start_main_~#t2~0.offset_15|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_76|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ULTIMATE.start_main_~#t0~0.base=|v_ULTIMATE.start_main_~#t0~0.base_36|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_28|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_395, ULTIMATE.start_main_~#t1~0.base=|v_ULTIMATE.start_main_~#t1~0.base_26|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_498|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_202, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_24, ~weak$$choice2~0=v_~weak$$choice2~0_323, ULTIMATE.start_main_~#t1~0.offset=|v_ULTIMATE.start_main_~#t1~0.offset_14|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_549} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, #NULL.offset, ULTIMATE.start_main_~#t0~0.offset, ~y$read_delayed~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2~0.base, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet56, ~main$tmp_guard1~0, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t2~0.offset, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t0~0.base, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_~#t1~0.base, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t1~0.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 13:44:56,976 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L838-1-->L840: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1~0.base_11|) |v_ULTIMATE.start_main_~#t1~0.offset_10| 1)) |v_#memory_int_15|) (= |v_ULTIMATE.start_main_~#t1~0.offset_10| 0) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1~0.base_11| 1)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1~0.base_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1~0.base_11| 4)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1~0.base_11|)) (not (= |v_ULTIMATE.start_main_~#t1~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1~0.base=|v_ULTIMATE.start_main_~#t1~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_15|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1~0.offset=|v_ULTIMATE.start_main_~#t1~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1~0.offset] because there is no mapped edge [2019-12-07 13:44:56,976 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L840-1-->L842: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t2~0.base_10|)) (= |v_ULTIMATE.start_main_~#t2~0.offset_9| 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2~0.base_10| 4)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2~0.base_10|) |v_ULTIMATE.start_main_~#t2~0.offset_9| 2)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2~0.base_10|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2~0.base_10| 1)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_4|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2~0.offset=|v_ULTIMATE.start_main_~#t2~0.offset_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2~0.base=|v_ULTIMATE.start_main_~#t2~0.base_10|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t2~0.offset, #length, ULTIMATE.start_main_~#t2~0.base] because there is no mapped edge [2019-12-07 13:44:56,977 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] P2ENTRY-->L4-3: Formula: (and (= v_~y$w_buff0~0_41 v_~y$w_buff1~0_28) (= (ite (not (and (not (= 0 (mod v_~y$w_buff1_used~0_70 256))) (not (= (mod v_~y$w_buff0_used~0_124 256) 0)))) 1 0) |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_11|) (= |v_P2Thread1of1ForFork0_#in~arg.offset_13| v_P2Thread1of1ForFork0_~arg.offset_11) (= v_~y$w_buff0_used~0_124 1) (= 1 v_~y$w_buff0~0_40) (= v_~y$w_buff1_used~0_70 v_~y$w_buff0_used~0_125) (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_13)) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_13 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_11|) (= |v_P2Thread1of1ForFork0_#in~arg.base_13| v_P2Thread1of1ForFork0_~arg.base_11)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_13|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_125, ~y$w_buff0~0=v_~y$w_buff0~0_41, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_13|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_11, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_13|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_11|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_124, ~y$w_buff1~0=v_~y$w_buff1~0_28, ~y$w_buff0~0=v_~y$w_buff0~0_40, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_11, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_13|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_13, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_70} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 13:44:56,977 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [967] [967] L797-2-->L797-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-767637240 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-767637240 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite28_Out-767637240| ~y$w_buff1~0_In-767637240)) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite28_Out-767637240| ~y$w_buff0~0_In-767637240) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-767637240, ~y$w_buff1~0=~y$w_buff1~0_In-767637240, ~y$w_buff0~0=~y$w_buff0~0_In-767637240, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-767637240} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-767637240|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-767637240, ~y$w_buff1~0=~y$w_buff1~0_In-767637240, ~y$w_buff0~0=~y$w_buff0~0_In-767637240, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-767637240} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 13:44:56,977 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [918] [918] L797-4-->L798: Formula: (= v_~y~0_67 |v_P2Thread1of1ForFork0_#t~ite28_6|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_6|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_5|, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_5|, ~y~0=v_~y~0_67} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29, ~y~0] because there is no mapped edge [2019-12-07 13:44:56,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [913] [913] L802-->L803: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_69 256))) (= v_~y$r_buff0_thd3~0_162 v_~y$r_buff0_thd3~0_161)) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_162, ~weak$$choice2~0=v_~weak$$choice2~0_69} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_8|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_10|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_161, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_11|, ~weak$$choice2~0=v_~weak$$choice2~0_69} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 13:44:56,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L805-->L805-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-1341247071 256)))) (or (and (not .cse0) (= ~y$mem_tmp~0_In-1341247071 |P2Thread1of1ForFork0_#t~ite48_Out-1341247071|)) (and .cse0 (= ~y~0_In-1341247071 |P2Thread1of1ForFork0_#t~ite48_Out-1341247071|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1341247071, ~y$flush_delayed~0=~y$flush_delayed~0_In-1341247071, ~y~0=~y~0_In-1341247071} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out-1341247071|, ~y$mem_tmp~0=~y$mem_tmp~0_In-1341247071, ~y$flush_delayed~0=~y$flush_delayed~0_In-1341247071, ~y~0=~y~0_In-1341247071} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 13:44:56,981 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [987] [987] P0ENTRY-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_100 1) v_~__unbuffered_cnt~0_99) (= |v_P0Thread1of1ForFork1_#in~arg.base_11| v_P0Thread1of1ForFork1_~arg.base_9) (= v_P0Thread1of1ForFork1_~arg.offset_9 |v_P0Thread1of1ForFork1_#in~arg.offset_11|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_7|) (= v_~x~0_40 v_~__unbuffered_p0_EAX~0_16) (= v_~z~0_14 1) (= 0 |v_P0Thread1of1ForFork1_#res.base_7|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_11|, ~x~0=v_~x~0_40} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_11|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_99, ~z~0=v_~z~0_14, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_11|, ~x~0=v_~x~0_40, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_9} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 13:44:56,987 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [968] [968] L813-->L813-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In889397801 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In889397801 256)))) (or (and (= ~y$w_buff0_used~0_In889397801 |P2Thread1of1ForFork0_#t~ite51_Out889397801|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite51_Out889397801| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In889397801, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In889397801} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In889397801, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In889397801, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out889397801|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-07 13:44:56,987 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L814-->L814-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In888784684 256))) (.cse0 (= (mod ~y$r_buff0_thd3~0_In888784684 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In888784684 256))) (.cse2 (= (mod ~y$r_buff1_thd3~0_In888784684 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite52_Out888784684| ~y$w_buff1_used~0_In888784684) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork0_#t~ite52_Out888784684|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In888784684, ~y$w_buff0_used~0=~y$w_buff0_used~0_In888784684, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In888784684, ~y$w_buff1_used~0=~y$w_buff1_used~0_In888784684} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In888784684, ~y$w_buff0_used~0=~y$w_buff0_used~0_In888784684, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In888784684, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out888784684|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In888784684} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-07 13:44:56,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L815-->L816: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1953696572 256))) (.cse0 (= ~y$r_buff0_thd3~0_Out1953696572 ~y$r_buff0_thd3~0_In1953696572)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1953696572 256)))) (or (and .cse0 .cse1) (and (not .cse1) (not .cse2) (= ~y$r_buff0_thd3~0_Out1953696572 0)) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1953696572, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1953696572} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1953696572, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out1953696572, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out1953696572|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-07 13:44:56,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [970] [970] L768-->L768-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-161235749 256)))) (or (and .cse0 (= |P1Thread1of1ForFork2_#t~ite25_Out-161235749| ~y~0_In-161235749)) (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite25_Out-161235749| ~y$mem_tmp~0_In-161235749)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-161235749, ~y$flush_delayed~0=~y$flush_delayed~0_In-161235749, ~y~0=~y~0_In-161235749} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-161235749, ~y$flush_delayed~0=~y$flush_delayed~0_In-161235749, ~y~0=~y~0_In-161235749, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out-161235749|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 13:44:56,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= v_~y~0_149 |v_P1Thread1of1ForFork2_#t~ite25_62|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1)) (= v_~y$flush_delayed~0_131 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_62|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~y$flush_delayed~0=v_~y$flush_delayed~0_131, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, ~y~0=v_~y~0_149, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_61|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 13:44:56,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [956] [956] L816-->L816-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In-108402390 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-108402390 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-108402390 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In-108402390 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd3~0_In-108402390 |P2Thread1of1ForFork0_#t~ite54_Out-108402390|) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite54_Out-108402390|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-108402390, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-108402390, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-108402390, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-108402390} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-108402390, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-108402390, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out-108402390|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-108402390, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-108402390} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 13:44:56,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L816-2-->P2EXIT: Formula: (and (= v_~y$r_buff1_thd3~0_174 |v_P2Thread1of1ForFork0_#t~ite54_30|) (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= (+ v_~__unbuffered_cnt~0_90 1) v_~__unbuffered_cnt~0_89) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_174, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_29|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 13:44:56,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [934] [934] L842-1-->L848: 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_51) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, ~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 13:44:56,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [957] [957] L848-2-->L848-5: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In1709881971 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite59_Out1709881971| |ULTIMATE.start_main_#t~ite58_Out1709881971|)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1709881971 256)))) (or (and (or .cse0 .cse1) (= ~y~0_In1709881971 |ULTIMATE.start_main_#t~ite58_Out1709881971|) .cse2) (and (not .cse0) .cse2 (not .cse1) (= ~y$w_buff1~0_In1709881971 |ULTIMATE.start_main_#t~ite58_Out1709881971|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1709881971, ~y~0=~y~0_In1709881971, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1709881971, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1709881971} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1709881971, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out1709881971|, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out1709881971|, ~y~0=~y~0_In1709881971, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1709881971, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1709881971} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 13:44:56,989 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [959] [959] L849-->L849-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In777229383 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In777229383 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite60_Out777229383|) (not .cse1)) (and (= ~y$w_buff0_used~0_In777229383 |ULTIMATE.start_main_#t~ite60_Out777229383|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In777229383, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In777229383} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out777229383|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In777229383, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In777229383} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 13:44:56,989 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [947] [947] L850-->L850-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-1739462987 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-1739462987 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-1739462987 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1739462987 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite61_Out-1739462987|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~y$w_buff1_used~0_In-1739462987 |ULTIMATE.start_main_#t~ite61_Out-1739462987|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1739462987, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1739462987, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1739462987, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1739462987} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1739462987|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1739462987, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1739462987, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1739462987, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1739462987} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 13:44:56,990 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [963] [963] L851-->L851-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-525121775 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-525121775 256) 0))) (or (and (= ~y$r_buff0_thd0~0_In-525121775 |ULTIMATE.start_main_#t~ite62_Out-525121775|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite62_Out-525121775|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-525121775, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-525121775} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-525121775|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-525121775, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-525121775} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 13:44:56,990 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [954] [954] L852-->L852-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1461504233 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1461504233 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1461504233 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-1461504233 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite63_Out-1461504233|)) (and (= |ULTIMATE.start_main_#t~ite63_Out-1461504233| ~y$r_buff1_thd0~0_In-1461504233) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1461504233, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1461504233, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1461504233, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1461504233} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-1461504233|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1461504233, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1461504233, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1461504233, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1461504233} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 13:44:56,990 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1022] [1022] L852-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p1_EAX~0_46) (= 1 v_~__unbuffered_p2_EAX~0_27) (= v_~__unbuffered_p1_EBX~0_26 0) (= 0 v_~__unbuffered_p0_EAX~0_24) (= v_~__unbuffered_p2_EBX~0_24 0))) 1 0)) 0 1) v_~main$tmp_guard1~0_21) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_~y$r_buff1_thd0~0_256 |v_ULTIMATE.start_main_#t~ite63_36|) (= (mod v_~main$tmp_guard1~0_21 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_36|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_24, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_26, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_46, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_27} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_35|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_24, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_26, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_46, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_27, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_256, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 13:44:57,050 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_ebd20d66-a81e-4ee7-a845-2db306f1904b/bin/utaipan/witness.graphml [2019-12-07 13:44:57,050 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 13:44:57,051 INFO L168 Benchmark]: Toolchain (without parser) took 31146.25 ms. Allocated memory was 1.0 GB in the beginning and 4.0 GB in the end (delta: 3.0 GB). Free memory was 934.0 MB in the beginning and 1.7 GB in the end (delta: -800.7 MB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. [2019-12-07 13:44:57,051 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 954.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:44:57,052 INFO L168 Benchmark]: CACSL2BoogieTranslator took 414.80 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 92.3 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -123.3 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-12-07 13:44:57,052 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.84 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-12-07 13:44:57,052 INFO L168 Benchmark]: Boogie Preprocessor took 27.80 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-12-07 13:44:57,052 INFO L168 Benchmark]: RCFGBuilder took 470.69 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 986.9 MB in the end (delta: 65.0 MB). Peak memory consumption was 65.0 MB. Max. memory is 11.5 GB. [2019-12-07 13:44:57,053 INFO L168 Benchmark]: TraceAbstraction took 30110.62 ms. Allocated memory was 1.1 GB in the beginning and 4.0 GB in the end (delta: 2.9 GB). Free memory was 986.9 MB in the beginning and 1.8 GB in the end (delta: -798.4 MB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2019-12-07 13:44:57,053 INFO L168 Benchmark]: Witness Printer took 77.26 ms. Allocated memory is still 4.0 GB. Free memory was 1.8 GB in the beginning and 1.7 GB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 11.5 GB. [2019-12-07 13:44:57,055 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 954.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 414.80 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 92.3 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -123.3 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.84 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.80 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 470.69 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 986.9 MB in the end (delta: 65.0 MB). Peak memory consumption was 65.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 30110.62 ms. Allocated memory was 1.1 GB in the beginning and 4.0 GB in the end (delta: 2.9 GB). Free memory was 986.9 MB in the beginning and 1.8 GB in the end (delta: -798.4 MB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. * Witness Printer took 77.26 ms. Allocated memory is still 4.0 GB. Free memory was 1.8 GB in the beginning and 1.7 GB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 196 ProgramPointsBefore, 104 ProgramPointsAfterwards, 242 TransitionsBefore, 126 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 53 ConcurrentYvCompositions, 28 ChoiceCompositions, 8964 VarBasedMoverChecksPositive, 323 VarBasedMoverChecksNegative, 90 SemBasedMoverChecksPositive, 332 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 122986 CheckedPairsTotal, 129 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L838] FCALL, FORK 0 pthread_create(&t0, 0, P0, 0) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L840] FCALL, FORK 0 pthread_create(&t1, 0, P1, 0) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L842] FCALL, FORK 0 pthread_create(&t2, 0, P2, 0) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L786] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L787] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L788] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L789] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L790] 3 y$r_buff0_thd3 = (_Bool)1 [L793] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 3 y$flush_delayed = weak$$choice2 [L796] 3 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L797] 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L798] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L798] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L799] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L799] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L800] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L800] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L801] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L801] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L803] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L805] 3 y = y$flush_delayed ? y$mem_tmp : y [L806] 3 y$flush_delayed = (_Bool)0 [L809] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L750] 2 x = 1 [L753] 2 __unbuffered_p1_EAX = x [L756] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L757] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L758] 2 y$flush_delayed = weak$$choice2 [L759] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L761] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L761] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L762] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L763] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L763] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L764] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L764] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L812] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L766] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L767] 2 __unbuffered_p1_EBX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L812] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L813] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L814] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L848] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L848] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L849] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L850] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L851] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 187 locations, 2 error locations. Result: UNSAFE, OverallTime: 29.9s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3171 SDtfs, 3908 SDslu, 5440 SDs, 0 SdLazy, 2540 SolverSat, 124 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 97 GetRequests, 15 SyntacticMatches, 7 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66466occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 14.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 32441 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 570 NumberOfCodeBlocks, 570 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 491 ConstructedInterpolants, 0 QuantifiedInterpolants, 63732 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...