./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix038_tso.oepc.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_dc29d2e6-22a9-4137-9185-6d4a2cebbe5a/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_dc29d2e6-22a9-4137-9185-6d4a2cebbe5a/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_dc29d2e6-22a9-4137-9185-6d4a2cebbe5a/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_dc29d2e6-22a9-4137-9185-6d4a2cebbe5a/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix038_tso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_dc29d2e6-22a9-4137-9185-6d4a2cebbe5a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_dc29d2e6-22a9-4137-9185-6d4a2cebbe5a/bin/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e5a00d3277360d730f286b872714a5b4d9cfc929 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 10:21:48,926 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:21:48,928 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:21:48,935 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:21:48,935 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:21:48,936 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:21:48,937 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:21:48,938 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:21:48,939 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:21:48,940 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:21:48,940 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:21:48,941 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:21:48,941 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:21:48,942 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:21:48,943 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:21:48,943 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:21:48,944 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:21:48,945 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:21:48,946 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:21:48,947 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:21:48,949 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:21:48,949 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:21:48,950 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:21:48,950 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:21:48,952 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:21:48,952 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:21:48,952 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:21:48,953 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:21:48,953 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:21:48,954 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:21:48,954 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:21:48,954 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:21:48,955 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:21:48,955 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:21:48,956 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:21:48,956 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:21:48,956 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:21:48,956 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:21:48,956 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:21:48,957 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:21:48,957 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:21:48,958 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_dc29d2e6-22a9-4137-9185-6d4a2cebbe5a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 10:21:48,967 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:21:48,967 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:21:48,968 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 10:21:48,968 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 10:21:48,968 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 10:21:48,969 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:21:48,969 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:21:48,969 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:21:48,969 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:21:48,969 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:21:48,969 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 10:21:48,969 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:21:48,969 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 10:21:48,970 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:21:48,970 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:21:48,970 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:21:48,970 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 10:21:48,970 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:21:48,970 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 10:21:48,970 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:21:48,970 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:21:48,971 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:21:48,971 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:21:48,971 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:21:48,971 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 10:21:48,971 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 10:21:48,971 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 10:21:48,971 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 10:21:48,971 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:21:48,972 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_dc29d2e6-22a9-4137-9185-6d4a2cebbe5a/bin/uautomizer 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 -> Automizer 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 -> e5a00d3277360d730f286b872714a5b4d9cfc929 [2019-12-07 10:21:49,073 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:21:49,083 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:21:49,086 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:21:49,087 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:21:49,088 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:21:49,088 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_dc29d2e6-22a9-4137-9185-6d4a2cebbe5a/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix038_tso.oepc.i [2019-12-07 10:21:49,129 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_dc29d2e6-22a9-4137-9185-6d4a2cebbe5a/bin/uautomizer/data/260012526/e71a16847eb34f8c977e3a8bbb427a61/FLAG7370aabd0 [2019-12-07 10:21:49,588 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:21:49,588 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_dc29d2e6-22a9-4137-9185-6d4a2cebbe5a/sv-benchmarks/c/pthread-wmm/mix038_tso.oepc.i [2019-12-07 10:21:49,598 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_dc29d2e6-22a9-4137-9185-6d4a2cebbe5a/bin/uautomizer/data/260012526/e71a16847eb34f8c977e3a8bbb427a61/FLAG7370aabd0 [2019-12-07 10:21:49,607 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_dc29d2e6-22a9-4137-9185-6d4a2cebbe5a/bin/uautomizer/data/260012526/e71a16847eb34f8c977e3a8bbb427a61 [2019-12-07 10:21:49,609 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:21:49,610 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:21:49,611 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:21:49,611 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:21:49,613 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:21:49,614 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:21:49" (1/1) ... [2019-12-07 10:21:49,615 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f8fae9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:21:49, skipping insertion in model container [2019-12-07 10:21:49,616 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:21:49" (1/1) ... [2019-12-07 10:21:49,620 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:21:49,649 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:21:49,904 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:21:49,911 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:21:49,956 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:21:50,001 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:21:50,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:21:50 WrapperNode [2019-12-07 10:21:50,001 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:21:50,002 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:21:50,002 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:21:50,002 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:21:50,007 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:21:50" (1/1) ... [2019-12-07 10:21:50,021 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:21:50" (1/1) ... [2019-12-07 10:21:50,041 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:21:50,042 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:21:50,042 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:21:50,042 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:21:50,048 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:21:50" (1/1) ... [2019-12-07 10:21:50,048 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:21:50" (1/1) ... [2019-12-07 10:21:50,052 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:21:50" (1/1) ... [2019-12-07 10:21:50,052 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:21:50" (1/1) ... [2019-12-07 10:21:50,059 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:21:50" (1/1) ... [2019-12-07 10:21:50,062 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:21:50" (1/1) ... [2019-12-07 10:21:50,065 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:21:50" (1/1) ... [2019-12-07 10:21:50,068 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:21:50,069 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:21:50,069 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:21:50,069 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:21:50,069 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:21:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dc29d2e6-22a9-4137-9185-6d4a2cebbe5a/bin/uautomizer/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 10:21:50,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 10:21:50,111 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 10:21:50,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 10:21:50,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 10:21:50,111 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 10:21:50,111 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 10:21:50,111 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 10:21:50,111 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 10:21:50,111 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 10:21:50,112 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 10:21:50,112 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 10:21:50,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:21:50,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:21:50,113 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 10:21:50,484 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:21:50,484 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 10:21:50,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:21:50 BoogieIcfgContainer [2019-12-07 10:21:50,485 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:21:50,486 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:21:50,486 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:21:50,489 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:21:50,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:21:49" (1/3) ... [2019-12-07 10:21:50,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77743013 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:21:50, skipping insertion in model container [2019-12-07 10:21:50,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:21:50" (2/3) ... [2019-12-07 10:21:50,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77743013 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:21:50, skipping insertion in model container [2019-12-07 10:21:50,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:21:50" (3/3) ... [2019-12-07 10:21:50,492 INFO L109 eAbstractionObserver]: Analyzing ICFG mix038_tso.oepc.i [2019-12-07 10:21:50,500 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 10:21:50,500 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:21:50,506 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 10:21:50,507 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 10:21:50,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,532 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,532 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,536 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,536 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,537 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,537 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,537 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,537 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,539 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,540 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,541 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,542 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:21:50,557 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 10:21:50,570 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:21:50,570 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 10:21:50,570 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:21:50,570 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:21:50,570 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:21:50,570 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:21:50,570 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:21:50,570 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:21:50,583 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 214 transitions [2019-12-07 10:21:50,584 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-07 10:21:50,638 INFO L134 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-07 10:21:50,638 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:21:50,648 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 576 event pairs. 9/171 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 10:21:50,662 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-07 10:21:50,690 INFO L134 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-07 10:21:50,690 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:21:50,696 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 576 event pairs. 9/171 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 10:21:50,710 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17074 [2019-12-07 10:21:50,711 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 10:21:53,471 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-07 10:21:53,569 INFO L206 etLargeBlockEncoding]: Checked pairs total: 83692 [2019-12-07 10:21:53,570 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-07 10:21:53,572 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 98 places, 109 transitions [2019-12-07 10:22:10,864 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 129810 states. [2019-12-07 10:22:10,865 INFO L276 IsEmpty]: Start isEmpty. Operand 129810 states. [2019-12-07 10:22:10,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 10:22:10,869 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:22:10,869 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 10:22:10,870 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:22:10,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:22:10,874 INFO L82 PathProgramCache]: Analyzing trace with hash 817279571, now seen corresponding path program 1 times [2019-12-07 10:22:10,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:22:10,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450042529] [2019-12-07 10:22:10,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:22:10,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:22:11,022 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 10:22:11,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450042529] [2019-12-07 10:22:11,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:22:11,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 10:22:11,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354486108] [2019-12-07 10:22:11,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:22:11,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:22:11,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:22:11,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:22:11,037 INFO L87 Difference]: Start difference. First operand 129810 states. Second operand 3 states. [2019-12-07 10:22:11,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:22:11,928 INFO L93 Difference]: Finished difference Result 129322 states and 554746 transitions. [2019-12-07 10:22:11,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:22:11,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 10:22:11,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:22:12,490 INFO L225 Difference]: With dead ends: 129322 [2019-12-07 10:22:12,490 INFO L226 Difference]: Without dead ends: 126774 [2019-12-07 10:22:12,491 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 10:22:18,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126774 states. [2019-12-07 10:22:20,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126774 to 126774. [2019-12-07 10:22:20,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126774 states. [2019-12-07 10:22:20,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126774 states to 126774 states and 544358 transitions. [2019-12-07 10:22:20,674 INFO L78 Accepts]: Start accepts. Automaton has 126774 states and 544358 transitions. Word has length 5 [2019-12-07 10:22:20,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:22:20,675 INFO L462 AbstractCegarLoop]: Abstraction has 126774 states and 544358 transitions. [2019-12-07 10:22:20,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:22:20,675 INFO L276 IsEmpty]: Start isEmpty. Operand 126774 states and 544358 transitions. [2019-12-07 10:22:20,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 10:22:20,677 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:22:20,677 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:22:20,677 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:22:20,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:22:20,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1829592591, now seen corresponding path program 1 times [2019-12-07 10:22:20,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:22:20,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610972663] [2019-12-07 10:22:20,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:22:20,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:22:20,744 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 10:22:20,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610972663] [2019-12-07 10:22:20,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:22:20,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:22:20,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721581354] [2019-12-07 10:22:20,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:22:20,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:22:20,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:22:20,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:22:20,747 INFO L87 Difference]: Start difference. First operand 126774 states and 544358 transitions. Second operand 4 states. [2019-12-07 10:22:21,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:22:21,806 INFO L93 Difference]: Finished difference Result 198214 states and 818020 transitions. [2019-12-07 10:22:21,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:22:21,807 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 10:22:21,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:22:22,748 INFO L225 Difference]: With dead ends: 198214 [2019-12-07 10:22:22,748 INFO L226 Difference]: Without dead ends: 198165 [2019-12-07 10:22:22,749 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:22:30,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198165 states. [2019-12-07 10:22:32,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198165 to 183268. [2019-12-07 10:22:32,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183268 states. [2019-12-07 10:22:32,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183268 states to 183268 states and 763968 transitions. [2019-12-07 10:22:32,873 INFO L78 Accepts]: Start accepts. Automaton has 183268 states and 763968 transitions. Word has length 11 [2019-12-07 10:22:32,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:22:32,873 INFO L462 AbstractCegarLoop]: Abstraction has 183268 states and 763968 transitions. [2019-12-07 10:22:32,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:22:32,873 INFO L276 IsEmpty]: Start isEmpty. Operand 183268 states and 763968 transitions. [2019-12-07 10:22:32,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 10:22:32,877 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:22:32,878 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:22:32,878 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:22:32,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:22:32,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1837025859, now seen corresponding path program 1 times [2019-12-07 10:22:32,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:22:32,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388351299] [2019-12-07 10:22:32,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:22:32,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:22:32,930 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 10:22:32,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388351299] [2019-12-07 10:22:32,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:22:32,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:22:32,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791594220] [2019-12-07 10:22:32,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:22:32,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:22:32,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:22:32,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:22:32,931 INFO L87 Difference]: Start difference. First operand 183268 states and 763968 transitions. Second operand 4 states. [2019-12-07 10:22:34,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:22:34,575 INFO L93 Difference]: Finished difference Result 261626 states and 1065461 transitions. [2019-12-07 10:22:34,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:22:34,576 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 10:22:34,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:22:35,240 INFO L225 Difference]: With dead ends: 261626 [2019-12-07 10:22:35,241 INFO L226 Difference]: Without dead ends: 261563 [2019-12-07 10:22:35,241 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:22:42,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261563 states. [2019-12-07 10:22:47,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261563 to 223048. [2019-12-07 10:22:47,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223048 states. [2019-12-07 10:22:48,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223048 states to 223048 states and 922460 transitions. [2019-12-07 10:22:48,294 INFO L78 Accepts]: Start accepts. Automaton has 223048 states and 922460 transitions. Word has length 13 [2019-12-07 10:22:48,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:22:48,295 INFO L462 AbstractCegarLoop]: Abstraction has 223048 states and 922460 transitions. [2019-12-07 10:22:48,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:22:48,295 INFO L276 IsEmpty]: Start isEmpty. Operand 223048 states and 922460 transitions. [2019-12-07 10:22:48,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 10:22:48,297 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:22:48,297 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:22:48,297 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:22:48,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:22:48,298 INFO L82 PathProgramCache]: Analyzing trace with hash 2085785430, now seen corresponding path program 1 times [2019-12-07 10:22:48,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:22:48,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294475709] [2019-12-07 10:22:48,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:22:48,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:22:48,344 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 10:22:48,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294475709] [2019-12-07 10:22:48,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:22:48,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:22:48,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820335588] [2019-12-07 10:22:48,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:22:48,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:22:48,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:22:48,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:22:48,345 INFO L87 Difference]: Start difference. First operand 223048 states and 922460 transitions. Second operand 4 states. [2019-12-07 10:22:49,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:22:49,693 INFO L93 Difference]: Finished difference Result 274912 states and 1127900 transitions. [2019-12-07 10:22:49,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:22:49,693 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 10:22:49,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:22:50,982 INFO L225 Difference]: With dead ends: 274912 [2019-12-07 10:22:50,982 INFO L226 Difference]: Without dead ends: 274912 [2019-12-07 10:22:50,982 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:23:00,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274912 states. [2019-12-07 10:23:03,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274912 to 235207. [2019-12-07 10:23:03,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235207 states. [2019-12-07 10:23:04,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235207 states to 235207 states and 973199 transitions. [2019-12-07 10:23:04,363 INFO L78 Accepts]: Start accepts. Automaton has 235207 states and 973199 transitions. Word has length 13 [2019-12-07 10:23:04,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:23:04,364 INFO L462 AbstractCegarLoop]: Abstraction has 235207 states and 973199 transitions. [2019-12-07 10:23:04,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:23:04,364 INFO L276 IsEmpty]: Start isEmpty. Operand 235207 states and 973199 transitions. [2019-12-07 10:23:04,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 10:23:04,379 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:23:04,379 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 10:23:04,379 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:23:04,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:23:04,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1321310855, now seen corresponding path program 1 times [2019-12-07 10:23:04,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:23:04,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554438472] [2019-12-07 10:23:04,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:23:04,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:23:04,474 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 10:23:04,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554438472] [2019-12-07 10:23:04,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:23:04,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:23:04,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099562817] [2019-12-07 10:23:04,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 10:23:04,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:23:04,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 10:23:04,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:23:04,475 INFO L87 Difference]: Start difference. First operand 235207 states and 973199 transitions. Second operand 7 states. [2019-12-07 10:23:07,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:23:07,094 INFO L93 Difference]: Finished difference Result 360659 states and 1449098 transitions. [2019-12-07 10:23:07,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 10:23:07,095 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-12-07 10:23:07,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:23:07,989 INFO L225 Difference]: With dead ends: 360659 [2019-12-07 10:23:07,989 INFO L226 Difference]: Without dead ends: 360561 [2019-12-07 10:23:07,990 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-12-07 10:23:18,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360561 states. [2019-12-07 10:23:22,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360561 to 247149. [2019-12-07 10:23:22,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247149 states. [2019-12-07 10:23:23,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247149 states to 247149 states and 1020130 transitions. [2019-12-07 10:23:23,923 INFO L78 Accepts]: Start accepts. Automaton has 247149 states and 1020130 transitions. Word has length 19 [2019-12-07 10:23:23,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:23:23,924 INFO L462 AbstractCegarLoop]: Abstraction has 247149 states and 1020130 transitions. [2019-12-07 10:23:23,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 10:23:23,924 INFO L276 IsEmpty]: Start isEmpty. Operand 247149 states and 1020130 transitions. [2019-12-07 10:23:23,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 10:23:23,935 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:23:23,935 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 10:23:23,936 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:23:23,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:23:23,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1693466862, now seen corresponding path program 1 times [2019-12-07 10:23:23,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:23:23,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528296815] [2019-12-07 10:23:23,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:23:23,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:23:24,001 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 10:23:24,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528296815] [2019-12-07 10:23:24,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:23:24,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:23:24,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509494372] [2019-12-07 10:23:24,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:23:24,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:23:24,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:23:24,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:23:24,002 INFO L87 Difference]: Start difference. First operand 247149 states and 1020130 transitions. Second operand 5 states. [2019-12-07 10:23:25,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:23:25,786 INFO L93 Difference]: Finished difference Result 356737 states and 1442571 transitions. [2019-12-07 10:23:25,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 10:23:25,787 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-07 10:23:25,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:23:27,284 INFO L225 Difference]: With dead ends: 356737 [2019-12-07 10:23:27,284 INFO L226 Difference]: Without dead ends: 356674 [2019-12-07 10:23:27,285 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 3 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 10:23:34,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356674 states. [2019-12-07 10:23:38,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356674 to 271745. [2019-12-07 10:23:38,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271745 states. [2019-12-07 10:23:39,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271745 states to 271745 states and 1116561 transitions. [2019-12-07 10:23:39,746 INFO L78 Accepts]: Start accepts. Automaton has 271745 states and 1116561 transitions. Word has length 19 [2019-12-07 10:23:39,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:23:39,746 INFO L462 AbstractCegarLoop]: Abstraction has 271745 states and 1116561 transitions. [2019-12-07 10:23:39,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:23:39,746 INFO L276 IsEmpty]: Start isEmpty. Operand 271745 states and 1116561 transitions. [2019-12-07 10:23:39,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 10:23:39,758 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:23:39,758 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 10:23:39,758 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:23:39,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:23:39,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1425104019, now seen corresponding path program 2 times [2019-12-07 10:23:39,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:23:39,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620949822] [2019-12-07 10:23:39,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:23:39,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:23:39,811 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 10:23:39,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620949822] [2019-12-07 10:23:39,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:23:39,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:23:39,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541636925] [2019-12-07 10:23:39,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:23:39,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:23:39,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:23:39,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:23:39,812 INFO L87 Difference]: Start difference. First operand 271745 states and 1116561 transitions. Second operand 5 states. [2019-12-07 10:23:44,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:23:44,600 INFO L93 Difference]: Finished difference Result 365193 states and 1473245 transitions. [2019-12-07 10:23:44,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 10:23:44,600 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-07 10:23:44,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:23:45,494 INFO L225 Difference]: With dead ends: 365193 [2019-12-07 10:23:45,494 INFO L226 Difference]: Without dead ends: 365095 [2019-12-07 10:23:45,494 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:23:53,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365095 states. [2019-12-07 10:23:57,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365095 to 264465. [2019-12-07 10:23:57,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264465 states. [2019-12-07 10:23:58,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264465 states to 264465 states and 1087306 transitions. [2019-12-07 10:23:58,508 INFO L78 Accepts]: Start accepts. Automaton has 264465 states and 1087306 transitions. Word has length 19 [2019-12-07 10:23:58,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:23:58,509 INFO L462 AbstractCegarLoop]: Abstraction has 264465 states and 1087306 transitions. [2019-12-07 10:23:58,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:23:58,509 INFO L276 IsEmpty]: Start isEmpty. Operand 264465 states and 1087306 transitions. [2019-12-07 10:23:58,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 10:23:58,523 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:23:58,523 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 10:23:58,523 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:23:58,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:23:58,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1862135222, now seen corresponding path program 1 times [2019-12-07 10:23:58,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:23:58,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975330330] [2019-12-07 10:23:58,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:23:58,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:23:58,577 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 10:23:58,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975330330] [2019-12-07 10:23:58,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:23:58,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:23:58,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187458709] [2019-12-07 10:23:58,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:23:58,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:23:58,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:23:58,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:23:58,578 INFO L87 Difference]: Start difference. First operand 264465 states and 1087306 transitions. Second operand 5 states. [2019-12-07 10:24:01,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:24:01,006 INFO L93 Difference]: Finished difference Result 382713 states and 1546571 transitions. [2019-12-07 10:24:01,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 10:24:01,007 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-07 10:24:01,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:24:01,933 INFO L225 Difference]: With dead ends: 382713 [2019-12-07 10:24:01,934 INFO L226 Difference]: Without dead ends: 382650 [2019-12-07 10:24:01,934 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 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 10:24:10,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382650 states. [2019-12-07 10:24:14,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382650 to 286851. [2019-12-07 10:24:14,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286851 states. [2019-12-07 10:24:15,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286851 states to 286851 states and 1177232 transitions. [2019-12-07 10:24:15,026 INFO L78 Accepts]: Start accepts. Automaton has 286851 states and 1177232 transitions. Word has length 19 [2019-12-07 10:24:15,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:24:15,026 INFO L462 AbstractCegarLoop]: Abstraction has 286851 states and 1177232 transitions. [2019-12-07 10:24:15,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:24:15,027 INFO L276 IsEmpty]: Start isEmpty. Operand 286851 states and 1177232 transitions. [2019-12-07 10:24:15,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 10:24:15,087 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:24:15,087 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] [2019-12-07 10:24:15,087 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:24:15,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:24:15,087 INFO L82 PathProgramCache]: Analyzing trace with hash -370188174, now seen corresponding path program 1 times [2019-12-07 10:24:15,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:24:15,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410550165] [2019-12-07 10:24:15,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:24:15,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:24:15,128 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 10:24:15,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410550165] [2019-12-07 10:24:15,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:24:15,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:24:15,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352227897] [2019-12-07 10:24:15,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:24:15,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:24:15,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:24:15,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:24:15,130 INFO L87 Difference]: Start difference. First operand 286851 states and 1177232 transitions. Second operand 4 states. [2019-12-07 10:24:15,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:24:15,723 INFO L93 Difference]: Finished difference Result 56675 states and 184808 transitions. [2019-12-07 10:24:15,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:24:15,724 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-07 10:24:15,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:24:15,801 INFO L225 Difference]: With dead ends: 56675 [2019-12-07 10:24:15,801 INFO L226 Difference]: Without dead ends: 50424 [2019-12-07 10:24:15,801 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 10:24:16,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50424 states. [2019-12-07 10:24:16,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50424 to 50424. [2019-12-07 10:24:16,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50424 states. [2019-12-07 10:24:16,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50424 states to 50424 states and 162097 transitions. [2019-12-07 10:24:16,586 INFO L78 Accepts]: Start accepts. Automaton has 50424 states and 162097 transitions. Word has length 25 [2019-12-07 10:24:16,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:24:16,586 INFO L462 AbstractCegarLoop]: Abstraction has 50424 states and 162097 transitions. [2019-12-07 10:24:16,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:24:16,587 INFO L276 IsEmpty]: Start isEmpty. Operand 50424 states and 162097 transitions. [2019-12-07 10:24:16,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 10:24:16,600 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:24:16,600 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:24:16,600 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:24:16,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:24:16,600 INFO L82 PathProgramCache]: Analyzing trace with hash -511165584, now seen corresponding path program 1 times [2019-12-07 10:24:16,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:24:16,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259761066] [2019-12-07 10:24:16,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:24:16,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:24:16,645 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 10:24:16,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259761066] [2019-12-07 10:24:16,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:24:16,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:24:16,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288581915] [2019-12-07 10:24:16,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:24:16,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:24:16,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:24:16,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:24:16,646 INFO L87 Difference]: Start difference. First operand 50424 states and 162097 transitions. Second operand 5 states. [2019-12-07 10:24:16,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:24:16,704 INFO L93 Difference]: Finished difference Result 11145 states and 30336 transitions. [2019-12-07 10:24:16,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:24:16,704 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-07 10:24:16,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:24:16,713 INFO L225 Difference]: With dead ends: 11145 [2019-12-07 10:24:16,713 INFO L226 Difference]: Without dead ends: 9742 [2019-12-07 10:24:16,713 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:24:16,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9742 states. [2019-12-07 10:24:16,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9742 to 9532. [2019-12-07 10:24:16,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9532 states. [2019-12-07 10:24:16,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9532 states to 9532 states and 25671 transitions. [2019-12-07 10:24:16,818 INFO L78 Accepts]: Start accepts. Automaton has 9532 states and 25671 transitions. Word has length 31 [2019-12-07 10:24:16,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:24:16,819 INFO L462 AbstractCegarLoop]: Abstraction has 9532 states and 25671 transitions. [2019-12-07 10:24:16,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:24:16,819 INFO L276 IsEmpty]: Start isEmpty. Operand 9532 states and 25671 transitions. [2019-12-07 10:24:16,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 10:24:16,824 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:24:16,825 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:24:16,825 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:24:16,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:24:16,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1153167478, now seen corresponding path program 1 times [2019-12-07 10:24:16,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:24:16,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361021582] [2019-12-07 10:24:16,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:24:16,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:24:16,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:24:16,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361021582] [2019-12-07 10:24:16,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:24:16,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:24:16,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027993562] [2019-12-07 10:24:16,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:24:16,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:24:16,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:24:16,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:24:16,877 INFO L87 Difference]: Start difference. First operand 9532 states and 25671 transitions. Second operand 6 states. [2019-12-07 10:24:16,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:24:16,930 INFO L93 Difference]: Finished difference Result 6843 states and 19372 transitions. [2019-12-07 10:24:16,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:24:16,930 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-12-07 10:24:16,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:24:16,935 INFO L225 Difference]: With dead ends: 6843 [2019-12-07 10:24:16,936 INFO L226 Difference]: Without dead ends: 6730 [2019-12-07 10:24:16,936 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:24:16,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6730 states. [2019-12-07 10:24:17,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6730 to 5841. [2019-12-07 10:24:17,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5841 states. [2019-12-07 10:24:17,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5841 states to 5841 states and 16742 transitions. [2019-12-07 10:24:17,011 INFO L78 Accepts]: Start accepts. Automaton has 5841 states and 16742 transitions. Word has length 37 [2019-12-07 10:24:17,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:24:17,011 INFO L462 AbstractCegarLoop]: Abstraction has 5841 states and 16742 transitions. [2019-12-07 10:24:17,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:24:17,011 INFO L276 IsEmpty]: Start isEmpty. Operand 5841 states and 16742 transitions. [2019-12-07 10:24:17,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 10:24:17,015 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:24:17,015 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, 1, 1] [2019-12-07 10:24:17,015 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:24:17,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:24:17,016 INFO L82 PathProgramCache]: Analyzing trace with hash -2000598711, now seen corresponding path program 1 times [2019-12-07 10:24:17,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:24:17,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584953789] [2019-12-07 10:24:17,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:24:17,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:24:17,047 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 10:24:17,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584953789] [2019-12-07 10:24:17,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:24:17,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:24:17,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136844186] [2019-12-07 10:24:17,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:24:17,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:24:17,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:24:17,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:24:17,048 INFO L87 Difference]: Start difference. First operand 5841 states and 16742 transitions. Second operand 3 states. [2019-12-07 10:24:17,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:24:17,089 INFO L93 Difference]: Finished difference Result 5853 states and 16754 transitions. [2019-12-07 10:24:17,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:24:17,089 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-07 10:24:17,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:24:17,094 INFO L225 Difference]: With dead ends: 5853 [2019-12-07 10:24:17,095 INFO L226 Difference]: Without dead ends: 5853 [2019-12-07 10:24:17,095 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:24:17,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5853 states. [2019-12-07 10:24:17,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5853 to 5844. [2019-12-07 10:24:17,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5844 states. [2019-12-07 10:24:17,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5844 states to 5844 states and 16745 transitions. [2019-12-07 10:24:17,162 INFO L78 Accepts]: Start accepts. Automaton has 5844 states and 16745 transitions. Word has length 65 [2019-12-07 10:24:17,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:24:17,162 INFO L462 AbstractCegarLoop]: Abstraction has 5844 states and 16745 transitions. [2019-12-07 10:24:17,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:24:17,163 INFO L276 IsEmpty]: Start isEmpty. Operand 5844 states and 16745 transitions. [2019-12-07 10:24:17,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 10:24:17,167 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:24:17,167 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, 1, 1] [2019-12-07 10:24:17,167 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:24:17,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:24:17,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1332314804, now seen corresponding path program 1 times [2019-12-07 10:24:17,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:24:17,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740361901] [2019-12-07 10:24:17,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:24:17,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:24:17,225 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 10:24:17,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740361901] [2019-12-07 10:24:17,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:24:17,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:24:17,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646624801] [2019-12-07 10:24:17,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:24:17,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:24:17,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:24:17,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:24:17,226 INFO L87 Difference]: Start difference. First operand 5844 states and 16745 transitions. Second operand 3 states. [2019-12-07 10:24:17,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:24:17,245 INFO L93 Difference]: Finished difference Result 5558 states and 15712 transitions. [2019-12-07 10:24:17,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:24:17,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-07 10:24:17,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:24:17,250 INFO L225 Difference]: With dead ends: 5558 [2019-12-07 10:24:17,250 INFO L226 Difference]: Without dead ends: 5558 [2019-12-07 10:24:17,251 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 10:24:17,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5558 states. [2019-12-07 10:24:17,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5558 to 5558. [2019-12-07 10:24:17,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5558 states. [2019-12-07 10:24:17,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5558 states to 5558 states and 15712 transitions. [2019-12-07 10:24:17,315 INFO L78 Accepts]: Start accepts. Automaton has 5558 states and 15712 transitions. Word has length 65 [2019-12-07 10:24:17,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:24:17,315 INFO L462 AbstractCegarLoop]: Abstraction has 5558 states and 15712 transitions. [2019-12-07 10:24:17,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:24:17,315 INFO L276 IsEmpty]: Start isEmpty. Operand 5558 states and 15712 transitions. [2019-12-07 10:24:17,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 10:24:17,319 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:24:17,319 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, 1, 1, 1] [2019-12-07 10:24:17,319 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:24:17,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:24:17,319 INFO L82 PathProgramCache]: Analyzing trace with hash 657704751, now seen corresponding path program 1 times [2019-12-07 10:24:17,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:24:17,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109740796] [2019-12-07 10:24:17,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:24:17,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:24:17,359 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 10:24:17,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109740796] [2019-12-07 10:24:17,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:24:17,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:24:17,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133580303] [2019-12-07 10:24:17,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:24:17,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:24:17,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:24:17,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:24:17,360 INFO L87 Difference]: Start difference. First operand 5558 states and 15712 transitions. Second operand 3 states. [2019-12-07 10:24:17,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:24:17,393 INFO L93 Difference]: Finished difference Result 5557 states and 15710 transitions. [2019-12-07 10:24:17,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:24:17,394 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 10:24:17,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:24:17,398 INFO L225 Difference]: With dead ends: 5557 [2019-12-07 10:24:17,398 INFO L226 Difference]: Without dead ends: 5557 [2019-12-07 10:24:17,399 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 10:24:17,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5557 states. [2019-12-07 10:24:17,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5557 to 4261. [2019-12-07 10:24:17,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4261 states. [2019-12-07 10:24:17,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4261 states to 4261 states and 12190 transitions. [2019-12-07 10:24:17,455 INFO L78 Accepts]: Start accepts. Automaton has 4261 states and 12190 transitions. Word has length 66 [2019-12-07 10:24:17,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:24:17,455 INFO L462 AbstractCegarLoop]: Abstraction has 4261 states and 12190 transitions. [2019-12-07 10:24:17,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:24:17,455 INFO L276 IsEmpty]: Start isEmpty. Operand 4261 states and 12190 transitions. [2019-12-07 10:24:17,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 10:24:17,458 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:24:17,458 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, 1, 1, 1, 1] [2019-12-07 10:24:17,458 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:24:17,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:24:17,458 INFO L82 PathProgramCache]: Analyzing trace with hash 445823329, now seen corresponding path program 1 times [2019-12-07 10:24:17,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:24:17,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606605313] [2019-12-07 10:24:17,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:24:17,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:24:17,548 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 10:24:17,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606605313] [2019-12-07 10:24:17,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:24:17,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 10:24:17,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52124880] [2019-12-07 10:24:17,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 10:24:17,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:24:17,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 10:24:17,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:24:17,550 INFO L87 Difference]: Start difference. First operand 4261 states and 12190 transitions. Second operand 7 states. [2019-12-07 10:24:17,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:24:17,642 INFO L93 Difference]: Finished difference Result 8523 states and 24581 transitions. [2019-12-07 10:24:17,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 10:24:17,642 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-07 10:24:17,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:24:17,646 INFO L225 Difference]: With dead ends: 8523 [2019-12-07 10:24:17,646 INFO L226 Difference]: Without dead ends: 4437 [2019-12-07 10:24:17,646 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-07 10:24:17,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4437 states. [2019-12-07 10:24:17,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4437 to 3613. [2019-12-07 10:24:17,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3613 states. [2019-12-07 10:24:17,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3613 states to 3613 states and 10237 transitions. [2019-12-07 10:24:17,697 INFO L78 Accepts]: Start accepts. Automaton has 3613 states and 10237 transitions. Word has length 67 [2019-12-07 10:24:17,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:24:17,697 INFO L462 AbstractCegarLoop]: Abstraction has 3613 states and 10237 transitions. [2019-12-07 10:24:17,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 10:24:17,697 INFO L276 IsEmpty]: Start isEmpty. Operand 3613 states and 10237 transitions. [2019-12-07 10:24:18,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 10:24:18,518 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:24:18,518 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, 1, 1, 1, 1] [2019-12-07 10:24:18,518 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:24:18,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:24:18,518 INFO L82 PathProgramCache]: Analyzing trace with hash 810593463, now seen corresponding path program 2 times [2019-12-07 10:24:18,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:24:18,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521164290] [2019-12-07 10:24:18,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:24:18,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:24:18,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:24:18,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521164290] [2019-12-07 10:24:18,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:24:18,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 10:24:18,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614989588] [2019-12-07 10:24:18,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 10:24:18,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:24:18,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 10:24:18,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-07 10:24:18,717 INFO L87 Difference]: Start difference. First operand 3613 states and 10237 transitions. Second operand 12 states. [2019-12-07 10:24:19,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:24:19,000 INFO L93 Difference]: Finished difference Result 7223 states and 20896 transitions. [2019-12-07 10:24:19,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 10:24:19,000 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-07 10:24:19,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:24:19,006 INFO L225 Difference]: With dead ends: 7223 [2019-12-07 10:24:19,006 INFO L226 Difference]: Without dead ends: 7192 [2019-12-07 10:24:19,006 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=433, Unknown=0, NotChecked=0, Total=552 [2019-12-07 10:24:19,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7192 states. [2019-12-07 10:24:19,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7192 to 4506. [2019-12-07 10:24:19,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4506 states. [2019-12-07 10:24:19,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4506 states to 4506 states and 12676 transitions. [2019-12-07 10:24:19,073 INFO L78 Accepts]: Start accepts. Automaton has 4506 states and 12676 transitions. Word has length 67 [2019-12-07 10:24:19,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:24:19,073 INFO L462 AbstractCegarLoop]: Abstraction has 4506 states and 12676 transitions. [2019-12-07 10:24:19,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 10:24:19,073 INFO L276 IsEmpty]: Start isEmpty. Operand 4506 states and 12676 transitions. [2019-12-07 10:24:19,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 10:24:19,076 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:24:19,076 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, 1, 1, 1, 1] [2019-12-07 10:24:19,076 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:24:19,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:24:19,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1733523625, now seen corresponding path program 3 times [2019-12-07 10:24:19,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:24:19,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266687669] [2019-12-07 10:24:19,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:24:19,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:24:19,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:24:19,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266687669] [2019-12-07 10:24:19,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:24:19,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:24:19,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974609745] [2019-12-07 10:24:19,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:24:19,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:24:19,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:24:19,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:24:19,121 INFO L87 Difference]: Start difference. First operand 4506 states and 12676 transitions. Second operand 3 states. [2019-12-07 10:24:19,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:24:19,139 INFO L93 Difference]: Finished difference Result 4294 states and 11859 transitions. [2019-12-07 10:24:19,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:24:19,140 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-07 10:24:19,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:24:19,144 INFO L225 Difference]: With dead ends: 4294 [2019-12-07 10:24:19,144 INFO L226 Difference]: Without dead ends: 4294 [2019-12-07 10:24:19,144 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 10:24:19,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4294 states. [2019-12-07 10:24:19,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4294 to 4140. [2019-12-07 10:24:19,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4140 states. [2019-12-07 10:24:19,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4140 states to 4140 states and 11433 transitions. [2019-12-07 10:24:19,195 INFO L78 Accepts]: Start accepts. Automaton has 4140 states and 11433 transitions. Word has length 67 [2019-12-07 10:24:19,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:24:19,195 INFO L462 AbstractCegarLoop]: Abstraction has 4140 states and 11433 transitions. [2019-12-07 10:24:19,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:24:19,195 INFO L276 IsEmpty]: Start isEmpty. Operand 4140 states and 11433 transitions. [2019-12-07 10:24:19,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-07 10:24:19,198 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:24:19,198 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, 1, 1, 1, 1, 1] [2019-12-07 10:24:19,198 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:24:19,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:24:19,198 INFO L82 PathProgramCache]: Analyzing trace with hash 839287492, now seen corresponding path program 1 times [2019-12-07 10:24:19,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:24:19,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212974500] [2019-12-07 10:24:19,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:24:19,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:24:19,462 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 10:24:19,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212974500] [2019-12-07 10:24:19,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:24:19,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 10:24:19,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887226388] [2019-12-07 10:24:19,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 10:24:19,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:24:19,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 10:24:19,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-12-07 10:24:19,463 INFO L87 Difference]: Start difference. First operand 4140 states and 11433 transitions. Second operand 14 states. [2019-12-07 10:24:19,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:24:19,894 INFO L93 Difference]: Finished difference Result 7936 states and 22052 transitions. [2019-12-07 10:24:19,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 10:24:19,894 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 68 [2019-12-07 10:24:19,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:24:19,900 INFO L225 Difference]: With dead ends: 7936 [2019-12-07 10:24:19,900 INFO L226 Difference]: Without dead ends: 7551 [2019-12-07 10:24:19,901 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=197, Invalid=733, Unknown=0, NotChecked=0, Total=930 [2019-12-07 10:24:19,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7551 states. [2019-12-07 10:24:19,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7551 to 4938. [2019-12-07 10:24:19,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4938 states. [2019-12-07 10:24:19,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4938 states to 4938 states and 13733 transitions. [2019-12-07 10:24:19,967 INFO L78 Accepts]: Start accepts. Automaton has 4938 states and 13733 transitions. Word has length 68 [2019-12-07 10:24:19,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:24:19,967 INFO L462 AbstractCegarLoop]: Abstraction has 4938 states and 13733 transitions. [2019-12-07 10:24:19,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 10:24:19,967 INFO L276 IsEmpty]: Start isEmpty. Operand 4938 states and 13733 transitions. [2019-12-07 10:24:19,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-07 10:24:19,970 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:24:19,970 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, 1, 1, 1, 1, 1] [2019-12-07 10:24:19,971 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:24:19,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:24:19,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1214731398, now seen corresponding path program 2 times [2019-12-07 10:24:19,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:24:19,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611907299] [2019-12-07 10:24:19,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:24:19,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:24:20,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:24:20,053 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:24:20,054 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 10:24:20,056 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] ULTIMATE.startENTRY-->L817: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= 0 v_~x~0_167) (= v_~x$r_buff0_thd1~0_194 0) (= v_~x$r_buff1_thd0~0_280 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1019~0.base_25|) 0) (= |v_#NULL.offset_6| 0) (= v_~x$r_buff0_thd0~0_376 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t1019~0.base_25| 4)) (= v_~a~0_13 0) (= v_~main$tmp_guard0~0_27 0) (< 0 |v_#StackHeapBarrier_19|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1019~0.base_25| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1019~0.base_25|) |v_ULTIMATE.start_main_~#t1019~0.offset_19| 0)) |v_#memory_int_15|) (= |v_#valid_64| (store .cse0 |v_ULTIMATE.start_main_~#t1019~0.base_25| 1)) (= 0 v_~x$read_delayed_var~0.base_7) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t1019~0.base_25|) (= 0 v_~x$r_buff0_thd2~0_295) (= 0 v_~x$w_buff0_used~0_668) (= 0 v_~x$r_buff1_thd2~0_179) (= 0 |v_#NULL.base_6|) (= 0 v_~x$read_delayed~0_7) (= 0 v_~x$w_buff1~0_150) (= 0 v_~x$w_buff0~0_169) (= v_~y~0_123 0) (= v_~main$tmp_guard1~0_23 0) (= 0 v_~x$r_buff0_thd3~0_178) (= v_~__unbuffered_cnt~0_130 0) (= 0 |v_ULTIMATE.start_main_~#t1019~0.offset_19|) (= 0 v_~z~0_9) (= v_~x$r_buff1_thd1~0_197 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~weak$$choice2~0_115 0) (= v_~x$mem_tmp~0_37 0) (= v_~__unbuffered_p2_EBX~0_19 0) (= v_~__unbuffered_p1_EAX~0_129 0) (= v_~x$flush_delayed~0_54 0) (= 0 v_~weak$$choice0~0_34) (= 0 v_~__unbuffered_p2_EAX~0_19) (= 0 v_~x$r_buff1_thd3~0_174) (= 0 v_~x$w_buff1_used~0_384))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_16|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_61|, ~x$w_buff0~0=v_~x$w_buff0~0_169, ULTIMATE.start_main_~#t1020~0.base=|v_ULTIMATE.start_main_~#t1020~0.base_27|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_37|, ~x$flush_delayed~0=v_~x$flush_delayed~0_54, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_37|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_33|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_141|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_35|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_197, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_178, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_36|, ULTIMATE.start_main_~#t1020~0.offset=|v_ULTIMATE.start_main_~#t1020~0.offset_20|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_28|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_33|, ~a~0=v_~a~0_13, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_32|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_129, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_19, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_376, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_19, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_10|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_59|, ~x$w_buff1~0=v_~x$w_buff1~0_150, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_56|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_384, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_179, ULTIMATE.start_main_~#t1021~0.base=|v_ULTIMATE.start_main_~#t1021~0.base_23|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_64|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_27|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_34, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_130, ~x~0=v_~x~0_167, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_194, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_61|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_75|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_30|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_27|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_174, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_163|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_19|, ~x$mem_tmp~0=v_~x$mem_tmp~0_37, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_25|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_37|, ~y~0=v_~y~0_123, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_9|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_16|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_43|, ULTIMATE.start_main_~#t1019~0.base=|v_ULTIMATE.start_main_~#t1019~0.base_25|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_64|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_280, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_295, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_27|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_56|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_668, ULTIMATE.start_main_~#t1021~0.offset=|v_ULTIMATE.start_main_~#t1021~0.offset_16|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_15|, ~z~0=v_~z~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_115, ULTIMATE.start_main_~#t1019~0.offset=|v_ULTIMATE.start_main_~#t1019~0.offset_19|, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ~x$w_buff0~0, ULTIMATE.start_main_~#t1020~0.base, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t1020~0.offset, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t1021~0.base, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ~y~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_~#t1019~0.base, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_~#t1021~0.offset, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t1019~0.offset, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 10:24:20,057 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] L817-1-->L819: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1020~0.base_13| 0)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1020~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1020~0.base_13|) |v_ULTIMATE.start_main_~#t1020~0.offset_11| 1)) |v_#memory_int_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1020~0.base_13| 4)) (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1020~0.base_13| 1) |v_#valid_38|) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1020~0.base_13|)) (= |v_ULTIMATE.start_main_~#t1020~0.offset_11| 0) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1020~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_5|, ULTIMATE.start_main_~#t1020~0.base=|v_ULTIMATE.start_main_~#t1020~0.base_13|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1020~0.offset=|v_ULTIMATE.start_main_~#t1020~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t1020~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1020~0.offset] because there is no mapped edge [2019-12-07 10:24:20,057 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [812] [812] L4-->L768: Formula: (and (= ~x$r_buff0_thd1~0_In-181936894 ~x$r_buff1_thd1~0_Out-181936894) (= ~x$r_buff1_thd0~0_Out-181936894 ~x$r_buff0_thd0~0_In-181936894) (= ~x$r_buff1_thd3~0_Out-181936894 ~x$r_buff0_thd3~0_In-181936894) (not (= P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-181936894 0)) (= ~x$r_buff1_thd2~0_Out-181936894 ~x$r_buff0_thd2~0_In-181936894) (= ~x$r_buff0_thd2~0_Out-181936894 1) (= ~__unbuffered_p1_EAX~0_Out-181936894 ~y~0_In-181936894)) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-181936894, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-181936894, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-181936894, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-181936894, ~y~0=~y~0_In-181936894, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-181936894} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-181936894, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-181936894, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-181936894, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out-181936894, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_Out-181936894, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out-181936894, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out-181936894, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-181936894, ~y~0=~y~0_In-181936894, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-181936894, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-181936894} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 10:24:20,058 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L769-->L769-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1062062143 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1062062143 256)))) (or (and (= ~x$w_buff0_used~0_In1062062143 |P1Thread1of1ForFork1_#t~ite11_Out1062062143|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out1062062143| 0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1062062143, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1062062143} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1062062143|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1062062143, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1062062143} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-07 10:24:20,058 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L770-->L770-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In-2033956694 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd2~0_In-2033956694 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-2033956694 256))) (.cse0 (= (mod ~x$r_buff1_thd2~0_In-2033956694 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-2033956694 |P1Thread1of1ForFork1_#t~ite12_Out-2033956694|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-2033956694|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-2033956694, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2033956694, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2033956694, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2033956694} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-2033956694, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2033956694, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-2033956694|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2033956694, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2033956694} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 10:24:20,059 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L771-->L772: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In64969551 256))) (.cse2 (= ~x$r_buff0_thd2~0_In64969551 ~x$r_buff0_thd2~0_Out64969551)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In64969551 256)))) (or (and (= ~x$r_buff0_thd2~0_Out64969551 0) (not .cse0) (not .cse1)) (and .cse1 .cse2) (and .cse2 .cse0))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In64969551, ~x$w_buff0_used~0=~x$w_buff0_used~0_In64969551} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out64969551|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out64969551, ~x$w_buff0_used~0=~x$w_buff0_used~0_In64969551} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 10:24:20,059 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L772-->L772-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In2130880463 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In2130880463 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In2130880463 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In2130880463 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite14_Out2130880463| ~x$r_buff1_thd2~0_In2130880463)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork1_#t~ite14_Out2130880463| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In2130880463, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2130880463, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2130880463, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2130880463} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In2130880463, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2130880463, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2130880463, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out2130880463|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2130880463} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 10:24:20,059 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L772-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_61 (+ v_~__unbuffered_cnt~0_62 1)) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~x$r_buff1_thd2~0_127 |v_P1Thread1of1ForFork1_#t~ite14_38|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_38|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_127, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_37|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 10:24:20,059 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L819-1-->L821: Formula: (and (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t1021~0.base_12| 1)) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t1021~0.base_12|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1021~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1021~0.base_12|) |v_ULTIMATE.start_main_~#t1021~0.offset_11| 2))) (not (= |v_ULTIMATE.start_main_~#t1021~0.base_12| 0)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1021~0.base_12| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1021~0.base_12|) (= |v_ULTIMATE.start_main_~#t1021~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1021~0.offset=|v_ULTIMATE.start_main_~#t1021~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_6|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t1021~0.base=|v_ULTIMATE.start_main_~#t1021~0.base_12|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1021~0.offset, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, ULTIMATE.start_main_~#t1021~0.base, #length] because there is no mapped edge [2019-12-07 10:24:20,060 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L794-2-->L794-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In-1623597840 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1623597840 256)))) (or (and (= ~x~0_In-1623597840 |P2Thread1of1ForFork2_#t~ite15_Out-1623597840|) (or .cse0 .cse1)) (and (= ~x$w_buff1~0_In-1623597840 |P2Thread1of1ForFork2_#t~ite15_Out-1623597840|) (not .cse0) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1623597840, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1623597840, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1623597840, ~x~0=~x~0_In-1623597840} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out-1623597840|, ~x$w_buff1~0=~x$w_buff1~0_In-1623597840, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1623597840, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1623597840, ~x~0=~x~0_In-1623597840} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-07 10:24:20,060 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L794-4-->L795: Formula: (= v_~x~0_23 |v_P2Thread1of1ForFork2_#t~ite15_10|) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_10|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_9|, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|, ~x~0=v_~x~0_23} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, P2Thread1of1ForFork2_#t~ite16, ~x~0] because there is no mapped edge [2019-12-07 10:24:20,060 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L739-2-->L739-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1763326381 256))) (.cse1 (= (mod ~x$r_buff1_thd1~0_In-1763326381 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite3_Out-1763326381| ~x~0_In-1763326381) (or .cse0 .cse1)) (and (not .cse0) (= ~x$w_buff1~0_In-1763326381 |P0Thread1of1ForFork0_#t~ite3_Out-1763326381|) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1763326381, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1763326381, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1763326381, ~x~0=~x~0_In-1763326381} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-1763326381|, ~x$w_buff1~0=~x$w_buff1~0_In-1763326381, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1763326381, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1763326381, ~x~0=~x~0_In-1763326381} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3] because there is no mapped edge [2019-12-07 10:24:20,060 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L739-4-->L740: Formula: (= v_~x~0_30 |v_P0Thread1of1ForFork0_#t~ite3_8|) InVars {P0Thread1of1ForFork0_#t~ite3=|v_P0Thread1of1ForFork0_#t~ite3_8|} OutVars{P0Thread1of1ForFork0_#t~ite3=|v_P0Thread1of1ForFork0_#t~ite3_7|, P0Thread1of1ForFork0_#t~ite4=|v_P0Thread1of1ForFork0_#t~ite4_11|, ~x~0=v_~x~0_30} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4, ~x~0] because there is no mapped edge [2019-12-07 10:24:20,060 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L795-->L795-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1240848341 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-1240848341 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite17_Out-1240848341| 0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite17_Out-1240848341| ~x$w_buff0_used~0_In-1240848341) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1240848341, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1240848341} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1240848341, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out-1240848341|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1240848341} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-07 10:24:20,061 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L796-->L796-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd3~0_In-1658793850 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1658793850 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-1658793850 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-1658793850 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-1658793850 |P2Thread1of1ForFork2_#t~ite18_Out-1658793850|) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork2_#t~ite18_Out-1658793850|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1658793850, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1658793850, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1658793850, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1658793850} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1658793850, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1658793850, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1658793850, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out-1658793850|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1658793850} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-07 10:24:20,061 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L797-->L797-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1270986780 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-1270986780 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd3~0_In-1270986780 |P2Thread1of1ForFork2_#t~ite19_Out-1270986780|)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite19_Out-1270986780| 0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1270986780, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1270986780} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1270986780, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out-1270986780|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1270986780} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-07 10:24:20,061 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L798-->L798-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In1653341868 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In1653341868 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In1653341868 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In1653341868 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite20_Out1653341868| ~x$r_buff1_thd3~0_In1653341868) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite20_Out1653341868| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1653341868, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1653341868, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1653341868, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1653341868} OutVars{P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out1653341868|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1653341868, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1653341868, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1653341868, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1653341868} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-07 10:24:20,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L798-2-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_73 (+ v_~__unbuffered_cnt~0_74 1)) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= |v_P2Thread1of1ForFork2_#t~ite20_36| v_~x$r_buff1_thd3~0_122)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_35|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_122, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~x$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 10:24:20,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L740-->L740-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-179612196 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-179612196 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-179612196|) (not .cse0) (not .cse1)) (and (= ~x$w_buff0_used~0_In-179612196 |P0Thread1of1ForFork0_#t~ite5_Out-179612196|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-179612196, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-179612196} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-179612196|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-179612196, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-179612196} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 10:24:20,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L741-->L741-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In374936013 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In374936013 256))) (.cse3 (= (mod ~x$r_buff1_thd1~0_In374936013 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In374936013 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out374936013| ~x$w_buff1_used~0_In374936013) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out374936013| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In374936013, ~x$w_buff1_used~0=~x$w_buff1_used~0_In374936013, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In374936013, ~x$w_buff0_used~0=~x$w_buff0_used~0_In374936013} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out374936013|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In374936013, ~x$w_buff1_used~0=~x$w_buff1_used~0_In374936013, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In374936013, ~x$w_buff0_used~0=~x$w_buff0_used~0_In374936013} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 10:24:20,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L742-->L742-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-444418147 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-444418147 256) 0))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite7_Out-444418147| 0)) (and (= |P0Thread1of1ForFork0_#t~ite7_Out-444418147| ~x$r_buff0_thd1~0_In-444418147) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-444418147, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-444418147} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-444418147, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-444418147|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-444418147} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-07 10:24:20,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L743-->L743-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-2111742757 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-2111742757 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-2111742757 256))) (.cse2 (= (mod ~x$r_buff1_thd1~0_In-2111742757 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out-2111742757| ~x$r_buff1_thd1~0_In-2111742757) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork0_#t~ite8_Out-2111742757| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2111742757, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2111742757, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2111742757, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2111742757} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2111742757, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-2111742757|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2111742757, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2111742757, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2111742757} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 10:24:20,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L743-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_83 |v_P0Thread1of1ForFork0_#t~ite8_26|) (= (+ v_~__unbuffered_cnt~0_44 1) v_~__unbuffered_cnt~0_43) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_83} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-07 10:24:20,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L825-->L827-2: Formula: (and (or (= (mod v_~x$w_buff0_used~0_107 256) 0) (= (mod v_~x$r_buff0_thd0~0_52 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_52, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_107} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_52, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_107} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 10:24:20,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L827-2-->L827-4: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In-2064364991 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-2064364991 256)))) (or (and (= |ULTIMATE.start_main_#t~ite24_Out-2064364991| ~x~0_In-2064364991) (or .cse0 .cse1)) (and (= ~x$w_buff1~0_In-2064364991 |ULTIMATE.start_main_#t~ite24_Out-2064364991|) (not .cse1) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-2064364991, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2064364991, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2064364991, ~x~0=~x~0_In-2064364991} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-2064364991, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-2064364991|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2064364991, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2064364991, ~x~0=~x~0_In-2064364991} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-07 10:24:20,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L827-4-->L828: Formula: (= v_~x~0_53 |v_ULTIMATE.start_main_#t~ite24_8|) InVars {ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_8|} OutVars{ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_7|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_8|, ~x~0=v_~x~0_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ~x~0] because there is no mapped edge [2019-12-07 10:24:20,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L828-->L828-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1670342603 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In1670342603 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite26_Out1670342603|) (not .cse1)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1670342603 |ULTIMATE.start_main_#t~ite26_Out1670342603|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1670342603, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1670342603} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1670342603, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out1670342603|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1670342603} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-07 10:24:20,064 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L829-->L829-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In-1738544923 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1738544923 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-1738544923 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-1738544923 256)))) (or (and (= ~x$w_buff1_used~0_In-1738544923 |ULTIMATE.start_main_#t~ite27_Out-1738544923|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite27_Out-1738544923|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1738544923, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1738544923, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1738544923, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1738544923} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1738544923, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1738544923, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-1738544923|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1738544923, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1738544923} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-07 10:24:20,064 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L830-->L830-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1135627975 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1135627975 256)))) (or (and (= |ULTIMATE.start_main_#t~ite28_Out1135627975| ~x$r_buff0_thd0~0_In1135627975) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite28_Out1135627975| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1135627975, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1135627975} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1135627975, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out1135627975|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1135627975} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-07 10:24:20,064 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L831-->L831-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In-509724359 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-509724359 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-509724359 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-509724359 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite29_Out-509724359|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite29_Out-509724359| ~x$r_buff1_thd0~0_In-509724359) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-509724359, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-509724359, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-509724359, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-509724359} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-509724359, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-509724359|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-509724359, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-509724359, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-509724359} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-07 10:24:20,067 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L843-->L844: Formula: (and (= v_~x$r_buff0_thd0~0_95 v_~x$r_buff0_thd0~0_94) (not (= 0 (mod v_~weak$$choice2~0_30 256)))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_95, ~weak$$choice2~0=v_~weak$$choice2~0_30} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_94, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_14|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_9|, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-07 10:24:20,067 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [811] [811] L844-->L844-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-309585837 256)))) (or (and (= ~x$r_buff1_thd0~0_In-309585837 |ULTIMATE.start_main_#t~ite50_Out-309585837|) (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-309585837 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In-309585837 256)) (and .cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-309585837 256))) (and .cse0 (= 0 (mod ~x$w_buff1_used~0_In-309585837 256))))) (= |ULTIMATE.start_main_#t~ite51_Out-309585837| |ULTIMATE.start_main_#t~ite50_Out-309585837|) .cse1) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite50_In-309585837| |ULTIMATE.start_main_#t~ite50_Out-309585837|) (= |ULTIMATE.start_main_#t~ite51_Out-309585837| ~x$r_buff1_thd0~0_In-309585837)))) InVars {ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_In-309585837|, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-309585837, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-309585837, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-309585837, ~weak$$choice2~0=~weak$$choice2~0_In-309585837, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-309585837} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-309585837|, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-309585837, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-309585837|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-309585837, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-309585837, ~weak$$choice2~0=~weak$$choice2~0_In-309585837, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-309585837} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-07 10:24:20,068 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] L846-->L4: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5| (mod v_~main$tmp_guard1~0_11 256)) (= v_~x$mem_tmp~0_32 v_~x~0_141) (not (= 0 (mod v_~x$flush_delayed~0_43 256))) (= v_~x$flush_delayed~0_42 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_43, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ~x$mem_tmp~0=v_~x$mem_tmp~0_32} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_18|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ~x$flush_delayed~0=v_~x$flush_delayed~0_42, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ~x$mem_tmp~0=v_~x$mem_tmp~0_32, ~x~0=v_~x~0_141, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~x$flush_delayed~0, ~x~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 10:24:20,068 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [793] [793] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-07 10:24:20,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 10:24:20 BasicIcfg [2019-12-07 10:24:20,124 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 10:24:20,125 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 10:24:20,125 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 10:24:20,125 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 10:24:20,125 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:21:50" (3/4) ... [2019-12-07 10:24:20,127 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 10:24:20,127 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] ULTIMATE.startENTRY-->L817: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= 0 v_~x~0_167) (= v_~x$r_buff0_thd1~0_194 0) (= v_~x$r_buff1_thd0~0_280 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1019~0.base_25|) 0) (= |v_#NULL.offset_6| 0) (= v_~x$r_buff0_thd0~0_376 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t1019~0.base_25| 4)) (= v_~a~0_13 0) (= v_~main$tmp_guard0~0_27 0) (< 0 |v_#StackHeapBarrier_19|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1019~0.base_25| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1019~0.base_25|) |v_ULTIMATE.start_main_~#t1019~0.offset_19| 0)) |v_#memory_int_15|) (= |v_#valid_64| (store .cse0 |v_ULTIMATE.start_main_~#t1019~0.base_25| 1)) (= 0 v_~x$read_delayed_var~0.base_7) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t1019~0.base_25|) (= 0 v_~x$r_buff0_thd2~0_295) (= 0 v_~x$w_buff0_used~0_668) (= 0 v_~x$r_buff1_thd2~0_179) (= 0 |v_#NULL.base_6|) (= 0 v_~x$read_delayed~0_7) (= 0 v_~x$w_buff1~0_150) (= 0 v_~x$w_buff0~0_169) (= v_~y~0_123 0) (= v_~main$tmp_guard1~0_23 0) (= 0 v_~x$r_buff0_thd3~0_178) (= v_~__unbuffered_cnt~0_130 0) (= 0 |v_ULTIMATE.start_main_~#t1019~0.offset_19|) (= 0 v_~z~0_9) (= v_~x$r_buff1_thd1~0_197 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~weak$$choice2~0_115 0) (= v_~x$mem_tmp~0_37 0) (= v_~__unbuffered_p2_EBX~0_19 0) (= v_~__unbuffered_p1_EAX~0_129 0) (= v_~x$flush_delayed~0_54 0) (= 0 v_~weak$$choice0~0_34) (= 0 v_~__unbuffered_p2_EAX~0_19) (= 0 v_~x$r_buff1_thd3~0_174) (= 0 v_~x$w_buff1_used~0_384))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_16|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_61|, ~x$w_buff0~0=v_~x$w_buff0~0_169, ULTIMATE.start_main_~#t1020~0.base=|v_ULTIMATE.start_main_~#t1020~0.base_27|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_37|, ~x$flush_delayed~0=v_~x$flush_delayed~0_54, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_37|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_33|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_141|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_35|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_197, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_178, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_36|, ULTIMATE.start_main_~#t1020~0.offset=|v_ULTIMATE.start_main_~#t1020~0.offset_20|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_28|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_33|, ~a~0=v_~a~0_13, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_32|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_129, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_19, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_376, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_19, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_10|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_59|, ~x$w_buff1~0=v_~x$w_buff1~0_150, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_56|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_384, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_179, ULTIMATE.start_main_~#t1021~0.base=|v_ULTIMATE.start_main_~#t1021~0.base_23|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_64|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_27|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_34, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_130, ~x~0=v_~x~0_167, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_194, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_61|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_75|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_30|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_27|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_174, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_163|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_19|, ~x$mem_tmp~0=v_~x$mem_tmp~0_37, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_25|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_37|, ~y~0=v_~y~0_123, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_9|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_16|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_43|, ULTIMATE.start_main_~#t1019~0.base=|v_ULTIMATE.start_main_~#t1019~0.base_25|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_64|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_280, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_295, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_27|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_56|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_668, ULTIMATE.start_main_~#t1021~0.offset=|v_ULTIMATE.start_main_~#t1021~0.offset_16|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_15|, ~z~0=v_~z~0_9, ~weak$$choice2~0=v_~weak$$choice2~0_115, ULTIMATE.start_main_~#t1019~0.offset=|v_ULTIMATE.start_main_~#t1019~0.offset_19|, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ~x$w_buff0~0, ULTIMATE.start_main_~#t1020~0.base, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t1020~0.offset, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t1021~0.base, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~__unbuffered_cnt~0, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ~y~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_~#t1019~0.base, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_~#t1021~0.offset, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t1019~0.offset, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 10:24:20,127 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] L817-1-->L819: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1020~0.base_13| 0)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1020~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1020~0.base_13|) |v_ULTIMATE.start_main_~#t1020~0.offset_11| 1)) |v_#memory_int_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1020~0.base_13| 4)) (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1020~0.base_13| 1) |v_#valid_38|) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1020~0.base_13|)) (= |v_ULTIMATE.start_main_~#t1020~0.offset_11| 0) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1020~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_5|, ULTIMATE.start_main_~#t1020~0.base=|v_ULTIMATE.start_main_~#t1020~0.base_13|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1020~0.offset=|v_ULTIMATE.start_main_~#t1020~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t1020~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1020~0.offset] because there is no mapped edge [2019-12-07 10:24:20,128 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [812] [812] L4-->L768: Formula: (and (= ~x$r_buff0_thd1~0_In-181936894 ~x$r_buff1_thd1~0_Out-181936894) (= ~x$r_buff1_thd0~0_Out-181936894 ~x$r_buff0_thd0~0_In-181936894) (= ~x$r_buff1_thd3~0_Out-181936894 ~x$r_buff0_thd3~0_In-181936894) (not (= P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-181936894 0)) (= ~x$r_buff1_thd2~0_Out-181936894 ~x$r_buff0_thd2~0_In-181936894) (= ~x$r_buff0_thd2~0_Out-181936894 1) (= ~__unbuffered_p1_EAX~0_Out-181936894 ~y~0_In-181936894)) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-181936894, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-181936894, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-181936894, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-181936894, ~y~0=~y~0_In-181936894, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-181936894} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-181936894, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-181936894, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-181936894, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out-181936894, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_Out-181936894, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out-181936894, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out-181936894, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-181936894, ~y~0=~y~0_In-181936894, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-181936894, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-181936894} AuxVars[] AssignedVars[~__unbuffered_p1_EAX~0, ~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 10:24:20,128 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L769-->L769-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1062062143 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1062062143 256)))) (or (and (= ~x$w_buff0_used~0_In1062062143 |P1Thread1of1ForFork1_#t~ite11_Out1062062143|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out1062062143| 0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1062062143, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1062062143} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1062062143|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1062062143, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1062062143} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-07 10:24:20,129 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L770-->L770-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In-2033956694 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd2~0_In-2033956694 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-2033956694 256))) (.cse0 (= (mod ~x$r_buff1_thd2~0_In-2033956694 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-2033956694 |P1Thread1of1ForFork1_#t~ite12_Out-2033956694|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-2033956694|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-2033956694, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2033956694, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2033956694, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2033956694} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-2033956694, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2033956694, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-2033956694|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2033956694, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2033956694} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 10:24:20,129 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L771-->L772: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In64969551 256))) (.cse2 (= ~x$r_buff0_thd2~0_In64969551 ~x$r_buff0_thd2~0_Out64969551)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In64969551 256)))) (or (and (= ~x$r_buff0_thd2~0_Out64969551 0) (not .cse0) (not .cse1)) (and .cse1 .cse2) (and .cse2 .cse0))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In64969551, ~x$w_buff0_used~0=~x$w_buff0_used~0_In64969551} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out64969551|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out64969551, ~x$w_buff0_used~0=~x$w_buff0_used~0_In64969551} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 10:24:20,129 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L772-->L772-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In2130880463 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In2130880463 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In2130880463 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In2130880463 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite14_Out2130880463| ~x$r_buff1_thd2~0_In2130880463)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork1_#t~ite14_Out2130880463| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In2130880463, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2130880463, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2130880463, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2130880463} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In2130880463, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In2130880463, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2130880463, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out2130880463|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2130880463} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 10:24:20,129 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L772-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_61 (+ v_~__unbuffered_cnt~0_62 1)) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~x$r_buff1_thd2~0_127 |v_P1Thread1of1ForFork1_#t~ite14_38|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_38|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_127, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_37|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 10:24:20,129 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L819-1-->L821: Formula: (and (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t1021~0.base_12| 1)) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t1021~0.base_12|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1021~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1021~0.base_12|) |v_ULTIMATE.start_main_~#t1021~0.offset_11| 2))) (not (= |v_ULTIMATE.start_main_~#t1021~0.base_12| 0)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1021~0.base_12| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1021~0.base_12|) (= |v_ULTIMATE.start_main_~#t1021~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1021~0.offset=|v_ULTIMATE.start_main_~#t1021~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_6|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t1021~0.base=|v_ULTIMATE.start_main_~#t1021~0.base_12|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1021~0.offset, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, ULTIMATE.start_main_~#t1021~0.base, #length] because there is no mapped edge [2019-12-07 10:24:20,130 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L794-2-->L794-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In-1623597840 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1623597840 256)))) (or (and (= ~x~0_In-1623597840 |P2Thread1of1ForFork2_#t~ite15_Out-1623597840|) (or .cse0 .cse1)) (and (= ~x$w_buff1~0_In-1623597840 |P2Thread1of1ForFork2_#t~ite15_Out-1623597840|) (not .cse0) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1623597840, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1623597840, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1623597840, ~x~0=~x~0_In-1623597840} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out-1623597840|, ~x$w_buff1~0=~x$w_buff1~0_In-1623597840, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1623597840, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1623597840, ~x~0=~x~0_In-1623597840} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-07 10:24:20,130 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L794-4-->L795: Formula: (= v_~x~0_23 |v_P2Thread1of1ForFork2_#t~ite15_10|) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_10|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_9|, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|, ~x~0=v_~x~0_23} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, P2Thread1of1ForFork2_#t~ite16, ~x~0] because there is no mapped edge [2019-12-07 10:24:20,131 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L739-2-->L739-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1763326381 256))) (.cse1 (= (mod ~x$r_buff1_thd1~0_In-1763326381 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite3_Out-1763326381| ~x~0_In-1763326381) (or .cse0 .cse1)) (and (not .cse0) (= ~x$w_buff1~0_In-1763326381 |P0Thread1of1ForFork0_#t~ite3_Out-1763326381|) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1763326381, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1763326381, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1763326381, ~x~0=~x~0_In-1763326381} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-1763326381|, ~x$w_buff1~0=~x$w_buff1~0_In-1763326381, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1763326381, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1763326381, ~x~0=~x~0_In-1763326381} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3] because there is no mapped edge [2019-12-07 10:24:20,131 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L739-4-->L740: Formula: (= v_~x~0_30 |v_P0Thread1of1ForFork0_#t~ite3_8|) InVars {P0Thread1of1ForFork0_#t~ite3=|v_P0Thread1of1ForFork0_#t~ite3_8|} OutVars{P0Thread1of1ForFork0_#t~ite3=|v_P0Thread1of1ForFork0_#t~ite3_7|, P0Thread1of1ForFork0_#t~ite4=|v_P0Thread1of1ForFork0_#t~ite4_11|, ~x~0=v_~x~0_30} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4, ~x~0] because there is no mapped edge [2019-12-07 10:24:20,131 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L795-->L795-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1240848341 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-1240848341 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite17_Out-1240848341| 0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite17_Out-1240848341| ~x$w_buff0_used~0_In-1240848341) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1240848341, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1240848341} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1240848341, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out-1240848341|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1240848341} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-07 10:24:20,131 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L796-->L796-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd3~0_In-1658793850 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1658793850 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-1658793850 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-1658793850 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-1658793850 |P2Thread1of1ForFork2_#t~ite18_Out-1658793850|) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork2_#t~ite18_Out-1658793850|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1658793850, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1658793850, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1658793850, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1658793850} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1658793850, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1658793850, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1658793850, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out-1658793850|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1658793850} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-07 10:24:20,131 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L797-->L797-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1270986780 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-1270986780 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd3~0_In-1270986780 |P2Thread1of1ForFork2_#t~ite19_Out-1270986780|)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite19_Out-1270986780| 0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1270986780, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1270986780} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1270986780, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out-1270986780|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1270986780} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-07 10:24:20,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L798-->L798-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In1653341868 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In1653341868 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In1653341868 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In1653341868 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite20_Out1653341868| ~x$r_buff1_thd3~0_In1653341868) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite20_Out1653341868| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1653341868, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1653341868, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1653341868, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1653341868} OutVars{P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out1653341868|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1653341868, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1653341868, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1653341868, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1653341868} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-07 10:24:20,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L798-2-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_73 (+ v_~__unbuffered_cnt~0_74 1)) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= |v_P2Thread1of1ForFork2_#t~ite20_36| v_~x$r_buff1_thd3~0_122)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_35|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_122, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~x$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 10:24:20,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L740-->L740-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-179612196 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-179612196 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-179612196|) (not .cse0) (not .cse1)) (and (= ~x$w_buff0_used~0_In-179612196 |P0Thread1of1ForFork0_#t~ite5_Out-179612196|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-179612196, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-179612196} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-179612196|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-179612196, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-179612196} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 10:24:20,132 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L741-->L741-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In374936013 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In374936013 256))) (.cse3 (= (mod ~x$r_buff1_thd1~0_In374936013 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In374936013 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out374936013| ~x$w_buff1_used~0_In374936013) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out374936013| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In374936013, ~x$w_buff1_used~0=~x$w_buff1_used~0_In374936013, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In374936013, ~x$w_buff0_used~0=~x$w_buff0_used~0_In374936013} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out374936013|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In374936013, ~x$w_buff1_used~0=~x$w_buff1_used~0_In374936013, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In374936013, ~x$w_buff0_used~0=~x$w_buff0_used~0_In374936013} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 10:24:20,133 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L742-->L742-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-444418147 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-444418147 256) 0))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite7_Out-444418147| 0)) (and (= |P0Thread1of1ForFork0_#t~ite7_Out-444418147| ~x$r_buff0_thd1~0_In-444418147) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-444418147, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-444418147} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-444418147, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-444418147|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-444418147} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-07 10:24:20,133 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L743-->L743-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-2111742757 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-2111742757 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-2111742757 256))) (.cse2 (= (mod ~x$r_buff1_thd1~0_In-2111742757 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out-2111742757| ~x$r_buff1_thd1~0_In-2111742757) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork0_#t~ite8_Out-2111742757| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2111742757, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2111742757, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2111742757, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2111742757} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2111742757, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-2111742757|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2111742757, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2111742757, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2111742757} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 10:24:20,133 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L743-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_83 |v_P0Thread1of1ForFork0_#t~ite8_26|) (= (+ v_~__unbuffered_cnt~0_44 1) v_~__unbuffered_cnt~0_43) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_83} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-07 10:24:20,133 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L825-->L827-2: Formula: (and (or (= (mod v_~x$w_buff0_used~0_107 256) 0) (= (mod v_~x$r_buff0_thd0~0_52 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_52, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_107} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_52, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_107} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 10:24:20,133 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L827-2-->L827-4: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In-2064364991 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-2064364991 256)))) (or (and (= |ULTIMATE.start_main_#t~ite24_Out-2064364991| ~x~0_In-2064364991) (or .cse0 .cse1)) (and (= ~x$w_buff1~0_In-2064364991 |ULTIMATE.start_main_#t~ite24_Out-2064364991|) (not .cse1) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-2064364991, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2064364991, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2064364991, ~x~0=~x~0_In-2064364991} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-2064364991, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-2064364991|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2064364991, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2064364991, ~x~0=~x~0_In-2064364991} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-07 10:24:20,133 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L827-4-->L828: Formula: (= v_~x~0_53 |v_ULTIMATE.start_main_#t~ite24_8|) InVars {ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_8|} OutVars{ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_7|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_8|, ~x~0=v_~x~0_53} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ~x~0] because there is no mapped edge [2019-12-07 10:24:20,134 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L828-->L828-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1670342603 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In1670342603 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite26_Out1670342603|) (not .cse1)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1670342603 |ULTIMATE.start_main_#t~ite26_Out1670342603|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1670342603, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1670342603} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1670342603, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out1670342603|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1670342603} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-07 10:24:20,135 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L829-->L829-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In-1738544923 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1738544923 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-1738544923 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-1738544923 256)))) (or (and (= ~x$w_buff1_used~0_In-1738544923 |ULTIMATE.start_main_#t~ite27_Out-1738544923|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite27_Out-1738544923|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1738544923, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1738544923, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1738544923, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1738544923} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1738544923, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1738544923, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-1738544923|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1738544923, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1738544923} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-07 10:24:20,136 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L830-->L830-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1135627975 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1135627975 256)))) (or (and (= |ULTIMATE.start_main_#t~ite28_Out1135627975| ~x$r_buff0_thd0~0_In1135627975) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite28_Out1135627975| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1135627975, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1135627975} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1135627975, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out1135627975|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1135627975} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-07 10:24:20,136 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L831-->L831-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In-509724359 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-509724359 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-509724359 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-509724359 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite29_Out-509724359|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite29_Out-509724359| ~x$r_buff1_thd0~0_In-509724359) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-509724359, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-509724359, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-509724359, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-509724359} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-509724359, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-509724359|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-509724359, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-509724359, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-509724359} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-07 10:24:20,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L843-->L844: Formula: (and (= v_~x$r_buff0_thd0~0_95 v_~x$r_buff0_thd0~0_94) (not (= 0 (mod v_~weak$$choice2~0_30 256)))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_95, ~weak$$choice2~0=v_~weak$$choice2~0_30} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_94, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_14|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_9|, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-07 10:24:20,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [811] [811] L844-->L844-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-309585837 256)))) (or (and (= ~x$r_buff1_thd0~0_In-309585837 |ULTIMATE.start_main_#t~ite50_Out-309585837|) (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-309585837 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In-309585837 256)) (and .cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-309585837 256))) (and .cse0 (= 0 (mod ~x$w_buff1_used~0_In-309585837 256))))) (= |ULTIMATE.start_main_#t~ite51_Out-309585837| |ULTIMATE.start_main_#t~ite50_Out-309585837|) .cse1) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite50_In-309585837| |ULTIMATE.start_main_#t~ite50_Out-309585837|) (= |ULTIMATE.start_main_#t~ite51_Out-309585837| ~x$r_buff1_thd0~0_In-309585837)))) InVars {ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_In-309585837|, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-309585837, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-309585837, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-309585837, ~weak$$choice2~0=~weak$$choice2~0_In-309585837, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-309585837} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-309585837|, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-309585837, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-309585837|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-309585837, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-309585837, ~weak$$choice2~0=~weak$$choice2~0_In-309585837, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-309585837} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-07 10:24:20,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] L846-->L4: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5| (mod v_~main$tmp_guard1~0_11 256)) (= v_~x$mem_tmp~0_32 v_~x~0_141) (not (= 0 (mod v_~x$flush_delayed~0_43 256))) (= v_~x$flush_delayed~0_42 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_43, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ~x$mem_tmp~0=v_~x$mem_tmp~0_32} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_18|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ~x$flush_delayed~0=v_~x$flush_delayed~0_42, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ~x$mem_tmp~0=v_~x$mem_tmp~0_32, ~x~0=v_~x~0_141, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~x$flush_delayed~0, ~x~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 10:24:20,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [793] [793] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-07 10:24:20,197 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_dc29d2e6-22a9-4137-9185-6d4a2cebbe5a/bin/uautomizer/witness.graphml [2019-12-07 10:24:20,197 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 10:24:20,198 INFO L168 Benchmark]: Toolchain (without parser) took 150587.76 ms. Allocated memory was 1.0 GB in the beginning and 7.4 GB in the end (delta: 6.4 GB). Free memory was 937.1 MB in the beginning and 6.4 GB in the end (delta: -5.5 GB). Peak memory consumption was 901.7 MB. Max. memory is 11.5 GB. [2019-12-07 10:24:20,198 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:24:20,199 INFO L168 Benchmark]: CACSL2BoogieTranslator took 390.63 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -144.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:24:20,199 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.73 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:24:20,199 INFO L168 Benchmark]: Boogie Preprocessor took 26.77 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:24:20,199 INFO L168 Benchmark]: RCFGBuilder took 416.57 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 61.6 MB). Peak memory consumption was 61.6 MB. Max. memory is 11.5 GB. [2019-12-07 10:24:20,200 INFO L168 Benchmark]: TraceAbstraction took 149638.47 ms. Allocated memory was 1.1 GB in the beginning and 7.4 GB in the end (delta: 6.3 GB). Free memory was 1.0 GB in the beginning and 6.5 GB in the end (delta: -5.5 GB). Peak memory consumption was 830.0 MB. Max. memory is 11.5 GB. [2019-12-07 10:24:20,200 INFO L168 Benchmark]: Witness Printer took 72.22 ms. Allocated memory is still 7.4 GB. Free memory was 6.5 GB in the beginning and 6.4 GB in the end (delta: 35.2 MB). Peak memory consumption was 35.2 MB. Max. memory is 11.5 GB. [2019-12-07 10:24:20,201 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 390.63 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -144.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.73 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.77 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 416.57 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 61.6 MB). Peak memory consumption was 61.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 149638.47 ms. Allocated memory was 1.1 GB in the beginning and 7.4 GB in the end (delta: 6.3 GB). Free memory was 1.0 GB in the beginning and 6.5 GB in the end (delta: -5.5 GB). Peak memory consumption was 830.0 MB. Max. memory is 11.5 GB. * Witness Printer took 72.22 ms. Allocated memory is still 7.4 GB. Free memory was 6.5 GB in the beginning and 6.4 GB in the end (delta: 35.2 MB). Peak memory consumption was 35.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.9s, 177 ProgramPointsBefore, 98 ProgramPointsAfterwards, 214 TransitionsBefore, 109 TransitionsAfterwards, 17074 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 30 ChoiceCompositions, 5956 VarBasedMoverChecksPositive, 212 VarBasedMoverChecksNegative, 43 SemBasedMoverChecksPositive, 249 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.8s, 0 MoverChecksTotal, 83692 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L817] FCALL, FORK 0 pthread_create(&t1019, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L819] FCALL, FORK 0 pthread_create(&t1020, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L753] 2 x$w_buff1 = x$w_buff0 [L754] 2 x$w_buff0 = 2 [L755] 2 x$w_buff1_used = x$w_buff0_used [L756] 2 x$w_buff0_used = (_Bool)1 [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L768] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L769] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L770] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L821] FCALL, FORK 0 pthread_create(&t1021, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L782] 3 y = 1 [L785] 3 z = 1 [L788] 3 __unbuffered_p2_EAX = z [L791] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L794] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L733] 1 a = 1 [L736] 1 x = 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=2, y=1, z=1] [L739] 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=2, y=1, z=1] [L795] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L796] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L797] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L740] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L741] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L742] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L823] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L828] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L829] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L830] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L831] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L834] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L835] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L836] 0 x$flush_delayed = weak$$choice2 [L837] 0 x$mem_tmp = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L838] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L838] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L839] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L839] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L840] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L840] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L841] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L841] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L842] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L842] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 149.4s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 26.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3423 SDtfs, 3345 SDslu, 7719 SDs, 0 SdLazy, 3489 SolverSat, 201 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 152 GetRequests, 18 SyntacticMatches, 14 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=286851occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 100.6s AutomataMinimizationTime, 18 MinimizatonAttempts, 496568 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 744 NumberOfCodeBlocks, 744 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 658 ConstructedInterpolants, 0 QuantifiedInterpolants, 176349 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...