./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix005_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_4172cee3-acaa-46e9-ba39-a8e8d1b7dd03/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_4172cee3-acaa-46e9-ba39-a8e8d1b7dd03/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_4172cee3-acaa-46e9-ba39-a8e8d1b7dd03/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_4172cee3-acaa-46e9-ba39-a8e8d1b7dd03/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix005_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_4172cee3-acaa-46e9-ba39-a8e8d1b7dd03/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_4172cee3-acaa-46e9-ba39-a8e8d1b7dd03/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 d73a04324f28b79f68d1a4a737e6d299074fba28 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 18:44:49,920 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:44:49,921 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:44:49,930 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:44:49,930 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:44:49,931 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:44:49,932 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:44:49,933 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:44:49,935 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:44:49,935 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:44:49,936 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:44:49,937 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:44:49,937 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:44:49,938 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:44:49,938 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:44:49,939 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:44:49,940 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:44:49,940 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:44:49,942 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:44:49,943 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:44:49,944 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:44:49,945 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:44:49,945 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:44:49,946 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:44:49,948 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:44:49,948 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:44:49,948 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:44:49,948 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:44:49,949 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:44:49,949 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:44:49,949 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:44:49,950 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:44:49,951 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:44:49,951 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:44:49,952 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:44:49,952 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:44:49,953 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:44:49,953 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:44:49,953 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:44:49,954 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:44:49,954 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:44:49,955 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_4172cee3-acaa-46e9-ba39-a8e8d1b7dd03/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 18:44:49,966 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:44:49,967 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:44:49,967 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:44:49,968 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:44:49,968 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:44:49,968 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:44:49,968 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:44:49,968 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:44:49,968 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:44:49,969 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:44:49,969 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 18:44:49,969 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:44:49,969 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 18:44:49,969 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:44:49,969 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:44:49,970 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:44:49,970 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 18:44:49,970 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:44:49,970 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:44:49,970 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:44:49,970 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:44:49,971 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:44:49,971 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:44:49,971 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:44:49,971 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 18:44:49,971 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:44:49,971 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:44:49,972 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 18:44:49,972 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:44:49,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_4172cee3-acaa-46e9-ba39-a8e8d1b7dd03/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 -> d73a04324f28b79f68d1a4a737e6d299074fba28 [2019-12-07 18:44:50,081 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:44:50,092 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:44:50,094 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:44:50,096 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:44:50,096 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:44:50,097 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_4172cee3-acaa-46e9-ba39-a8e8d1b7dd03/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix005_pso.opt.i [2019-12-07 18:44:50,137 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4172cee3-acaa-46e9-ba39-a8e8d1b7dd03/bin/uautomizer/data/f65ecd4a7/88a21d4c56bf4357baf63189db26ca36/FLAG7439df454 [2019-12-07 18:44:50,494 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:44:50,494 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_4172cee3-acaa-46e9-ba39-a8e8d1b7dd03/sv-benchmarks/c/pthread-wmm/mix005_pso.opt.i [2019-12-07 18:44:50,505 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4172cee3-acaa-46e9-ba39-a8e8d1b7dd03/bin/uautomizer/data/f65ecd4a7/88a21d4c56bf4357baf63189db26ca36/FLAG7439df454 [2019-12-07 18:44:50,514 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_4172cee3-acaa-46e9-ba39-a8e8d1b7dd03/bin/uautomizer/data/f65ecd4a7/88a21d4c56bf4357baf63189db26ca36 [2019-12-07 18:44:50,516 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:44:50,517 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:44:50,517 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:44:50,517 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:44:50,519 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:44:50,520 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:44:50" (1/1) ... [2019-12-07 18:44:50,522 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@487c6bda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:44:50, skipping insertion in model container [2019-12-07 18:44:50,522 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:44:50" (1/1) ... [2019-12-07 18:44:50,526 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:44:50,558 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:44:50,831 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:44:50,838 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:44:50,882 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:44:50,928 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:44:50,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:44:50 WrapperNode [2019-12-07 18:44:50,928 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:44:50,929 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:44:50,929 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:44:50,929 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:44:50,934 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:44:50" (1/1) ... [2019-12-07 18:44:50,948 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:44:50" (1/1) ... [2019-12-07 18:44:50,970 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:44:50,970 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:44:50,970 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:44:50,971 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:44:50,977 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:44:50" (1/1) ... [2019-12-07 18:44:50,978 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:44:50" (1/1) ... [2019-12-07 18:44:50,981 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:44:50" (1/1) ... [2019-12-07 18:44:50,982 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:44:50" (1/1) ... [2019-12-07 18:44:50,990 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:44:50" (1/1) ... [2019-12-07 18:44:50,993 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:44:50" (1/1) ... [2019-12-07 18:44:50,996 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:44:50" (1/1) ... [2019-12-07 18:44:50,999 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:44:50,999 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:44:51,000 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:44:51,000 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:44:51,000 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:44:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4172cee3-acaa-46e9-ba39-a8e8d1b7dd03/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 18:44:51,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 18:44:51,042 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 18:44:51,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 18:44:51,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 18:44:51,043 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 18:44:51,043 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 18:44:51,043 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 18:44:51,043 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 18:44:51,043 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 18:44:51,043 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 18:44:51,043 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 18:44:51,043 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 18:44:51,043 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 18:44:51,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:44:51,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:44:51,045 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 18:44:51,450 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:44:51,450 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 18:44:51,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:44:51 BoogieIcfgContainer [2019-12-07 18:44:51,451 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:44:51,452 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:44:51,452 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:44:51,454 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:44:51,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:44:50" (1/3) ... [2019-12-07 18:44:51,454 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e12cd0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:44:51, skipping insertion in model container [2019-12-07 18:44:51,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:44:50" (2/3) ... [2019-12-07 18:44:51,455 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e12cd0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:44:51, skipping insertion in model container [2019-12-07 18:44:51,455 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:44:51" (3/3) ... [2019-12-07 18:44:51,456 INFO L109 eAbstractionObserver]: Analyzing ICFG mix005_pso.opt.i [2019-12-07 18:44:51,462 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 18:44:51,462 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:44:51,467 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 18:44:51,467 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 18:44:51,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,494 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,495 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,495 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,495 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,496 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,496 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,497 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,497 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,497 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,498 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,499 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,500 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,509 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,510 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,511 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,512 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,513 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,514 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,514 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,514 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,514 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,514 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,515 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,515 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,515 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,515 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,515 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,515 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,516 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,516 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,516 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,516 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,516 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,516 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,517 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,517 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,517 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,517 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,517 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,517 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,518 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,518 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,518 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,518 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,518 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,518 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,519 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,519 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,519 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,519 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,519 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,519 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,519 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,520 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,520 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,520 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,520 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,520 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,520 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,521 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,521 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,521 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,521 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,521 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,521 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,521 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,522 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,522 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,522 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,522 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,522 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,522 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,523 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,523 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,523 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,523 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,523 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,523 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,523 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,524 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,524 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,524 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,524 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,524 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,524 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,525 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,525 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,525 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,525 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,525 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,525 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,525 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,526 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,526 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,526 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,526 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,526 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,526 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,526 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,527 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,527 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,527 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,527 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,527 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,527 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,528 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,528 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,528 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,528 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,528 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,528 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,528 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,529 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,529 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,529 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,529 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,529 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,529 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,529 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,530 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,530 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,530 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,530 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,530 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,530 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,530 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,531 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,531 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,531 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,531 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,531 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,531 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,532 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,532 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,532 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,532 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,532 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,532 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,533 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:44:51,547 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 18:44:51,559 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:44:51,559 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 18:44:51,559 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:44:51,560 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:44:51,560 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:44:51,560 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:44:51,560 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:44:51,560 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:44:51,571 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 212 places, 255 transitions [2019-12-07 18:44:51,572 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 212 places, 255 transitions [2019-12-07 18:44:51,653 INFO L134 PetriNetUnfolder]: 56/251 cut-off events. [2019-12-07 18:44:51,653 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:44:51,666 INFO L76 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 251 events. 56/251 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 941 event pairs. 12/205 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 18:44:51,689 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 212 places, 255 transitions [2019-12-07 18:44:51,726 INFO L134 PetriNetUnfolder]: 56/251 cut-off events. [2019-12-07 18:44:51,726 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:44:51,735 INFO L76 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 251 events. 56/251 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 941 event pairs. 12/205 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 18:44:51,768 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 26510 [2019-12-07 18:44:51,769 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 18:44:55,349 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-12-07 18:44:55,565 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-07 18:44:55,689 INFO L206 etLargeBlockEncoding]: Checked pairs total: 141939 [2019-12-07 18:44:55,689 INFO L214 etLargeBlockEncoding]: Total number of compositions: 133 [2019-12-07 18:44:55,691 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 112 places, 132 transitions [2019-12-07 18:45:03,052 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 85966 states. [2019-12-07 18:45:03,054 INFO L276 IsEmpty]: Start isEmpty. Operand 85966 states. [2019-12-07 18:45:03,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 18:45:03,059 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:45:03,059 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:45:03,059 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:45:03,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:45:03,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1287441752, now seen corresponding path program 1 times [2019-12-07 18:45:03,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:45:03,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835771535] [2019-12-07 18:45:03,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:45:03,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:45:03,223 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 18:45:03,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835771535] [2019-12-07 18:45:03,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:45:03,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 18:45:03,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167509138] [2019-12-07 18:45:03,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:45:03,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:45:03,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:45:03,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:45:03,238 INFO L87 Difference]: Start difference. First operand 85966 states. Second operand 3 states. [2019-12-07 18:45:03,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:45:03,966 INFO L93 Difference]: Finished difference Result 85406 states and 393472 transitions. [2019-12-07 18:45:03,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:45:03,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 18:45:03,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:45:04,363 INFO L225 Difference]: With dead ends: 85406 [2019-12-07 18:45:04,364 INFO L226 Difference]: Without dead ends: 79558 [2019-12-07 18:45:04,364 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 18:45:05,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79558 states. [2019-12-07 18:45:06,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79558 to 79558. [2019-12-07 18:45:06,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79558 states. [2019-12-07 18:45:07,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79558 states to 79558 states and 366284 transitions. [2019-12-07 18:45:07,268 INFO L78 Accepts]: Start accepts. Automaton has 79558 states and 366284 transitions. Word has length 9 [2019-12-07 18:45:07,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:45:07,269 INFO L462 AbstractCegarLoop]: Abstraction has 79558 states and 366284 transitions. [2019-12-07 18:45:07,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:45:07,269 INFO L276 IsEmpty]: Start isEmpty. Operand 79558 states and 366284 transitions. [2019-12-07 18:45:07,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 18:45:07,275 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:45:07,275 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:45:07,275 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:45:07,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:45:07,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1721975953, now seen corresponding path program 1 times [2019-12-07 18:45:07,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:45:07,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503307808] [2019-12-07 18:45:07,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:45:07,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:45:07,336 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 18:45:07,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503307808] [2019-12-07 18:45:07,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:45:07,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:45:07,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117512178] [2019-12-07 18:45:07,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:45:07,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:45:07,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:45:07,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:45:07,338 INFO L87 Difference]: Start difference. First operand 79558 states and 366284 transitions. Second operand 4 states. [2019-12-07 18:45:08,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:45:08,189 INFO L93 Difference]: Finished difference Result 126790 states and 563012 transitions. [2019-12-07 18:45:08,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:45:08,189 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 18:45:08,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:45:08,569 INFO L225 Difference]: With dead ends: 126790 [2019-12-07 18:45:08,569 INFO L226 Difference]: Without dead ends: 126726 [2019-12-07 18:45:08,570 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 18:45:11,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126726 states. [2019-12-07 18:45:13,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126726 to 123582. [2019-12-07 18:45:13,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123582 states. [2019-12-07 18:45:13,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123582 states to 123582 states and 551516 transitions. [2019-12-07 18:45:13,914 INFO L78 Accepts]: Start accepts. Automaton has 123582 states and 551516 transitions. Word has length 15 [2019-12-07 18:45:13,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:45:13,914 INFO L462 AbstractCegarLoop]: Abstraction has 123582 states and 551516 transitions. [2019-12-07 18:45:13,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:45:13,914 INFO L276 IsEmpty]: Start isEmpty. Operand 123582 states and 551516 transitions. [2019-12-07 18:45:13,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 18:45:13,920 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:45:13,920 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:45:13,920 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:45:13,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:45:13,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1760528869, now seen corresponding path program 1 times [2019-12-07 18:45:13,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:45:13,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358418916] [2019-12-07 18:45:13,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:45:13,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:45:13,964 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 18:45:13,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358418916] [2019-12-07 18:45:13,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:45:13,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:45:13,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577790000] [2019-12-07 18:45:13,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:45:13,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:45:13,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:45:13,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:45:13,965 INFO L87 Difference]: Start difference. First operand 123582 states and 551516 transitions. Second operand 4 states. [2019-12-07 18:45:15,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:45:15,172 INFO L93 Difference]: Finished difference Result 159910 states and 703928 transitions. [2019-12-07 18:45:15,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:45:15,173 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 18:45:15,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:45:15,601 INFO L225 Difference]: With dead ends: 159910 [2019-12-07 18:45:15,601 INFO L226 Difference]: Without dead ends: 159850 [2019-12-07 18:45:15,602 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 18:45:17,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159850 states. [2019-12-07 18:45:21,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159850 to 141658. [2019-12-07 18:45:21,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141658 states. [2019-12-07 18:45:21,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141658 states to 141658 states and 629312 transitions. [2019-12-07 18:45:21,677 INFO L78 Accepts]: Start accepts. Automaton has 141658 states and 629312 transitions. Word has length 18 [2019-12-07 18:45:21,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:45:21,677 INFO L462 AbstractCegarLoop]: Abstraction has 141658 states and 629312 transitions. [2019-12-07 18:45:21,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:45:21,677 INFO L276 IsEmpty]: Start isEmpty. Operand 141658 states and 629312 transitions. [2019-12-07 18:45:21,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 18:45:21,689 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:45:21,689 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] [2019-12-07 18:45:21,689 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:45:21,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:45:21,689 INFO L82 PathProgramCache]: Analyzing trace with hash 176800759, now seen corresponding path program 1 times [2019-12-07 18:45:21,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:45:21,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077887237] [2019-12-07 18:45:21,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:45:21,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:45:21,745 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 18:45:21,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077887237] [2019-12-07 18:45:21,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:45:21,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:45:21,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505101297] [2019-12-07 18:45:21,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:45:21,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:45:21,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:45:21,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:45:21,746 INFO L87 Difference]: Start difference. First operand 141658 states and 629312 transitions. Second operand 3 states. [2019-12-07 18:45:22,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:45:22,416 INFO L93 Difference]: Finished difference Result 141658 states and 623292 transitions. [2019-12-07 18:45:22,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:45:22,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 18:45:22,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:45:22,814 INFO L225 Difference]: With dead ends: 141658 [2019-12-07 18:45:22,814 INFO L226 Difference]: Without dead ends: 141658 [2019-12-07 18:45:22,815 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 18:45:24,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141658 states. [2019-12-07 18:45:26,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141658 to 141210. [2019-12-07 18:45:26,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141210 states. [2019-12-07 18:45:29,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141210 states to 141210 states and 621644 transitions. [2019-12-07 18:45:29,631 INFO L78 Accepts]: Start accepts. Automaton has 141210 states and 621644 transitions. Word has length 20 [2019-12-07 18:45:29,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:45:29,631 INFO L462 AbstractCegarLoop]: Abstraction has 141210 states and 621644 transitions. [2019-12-07 18:45:29,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:45:29,631 INFO L276 IsEmpty]: Start isEmpty. Operand 141210 states and 621644 transitions. [2019-12-07 18:45:29,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 18:45:29,640 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:45:29,640 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] [2019-12-07 18:45:29,640 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:45:29,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:45:29,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1362298761, now seen corresponding path program 1 times [2019-12-07 18:45:29,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:45:29,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934795877] [2019-12-07 18:45:29,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:45:29,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:45:29,692 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 18:45:29,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934795877] [2019-12-07 18:45:29,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:45:29,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:45:29,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980912972] [2019-12-07 18:45:29,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:45:29,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:45:29,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:45:29,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:45:29,693 INFO L87 Difference]: Start difference. First operand 141210 states and 621644 transitions. Second operand 4 states. [2019-12-07 18:45:30,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:45:30,226 INFO L93 Difference]: Finished difference Result 117572 states and 477168 transitions. [2019-12-07 18:45:30,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:45:30,226 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-12-07 18:45:30,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:45:30,513 INFO L225 Difference]: With dead ends: 117572 [2019-12-07 18:45:30,513 INFO L226 Difference]: Without dead ends: 109256 [2019-12-07 18:45:30,513 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 18:45:31,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109256 states. [2019-12-07 18:45:33,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109256 to 109256. [2019-12-07 18:45:33,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109256 states. [2019-12-07 18:45:33,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109256 states to 109256 states and 445830 transitions. [2019-12-07 18:45:33,500 INFO L78 Accepts]: Start accepts. Automaton has 109256 states and 445830 transitions. Word has length 20 [2019-12-07 18:45:33,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:45:33,500 INFO L462 AbstractCegarLoop]: Abstraction has 109256 states and 445830 transitions. [2019-12-07 18:45:33,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:45:33,500 INFO L276 IsEmpty]: Start isEmpty. Operand 109256 states and 445830 transitions. [2019-12-07 18:45:33,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 18:45:33,507 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:45:33,507 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:45:33,507 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:45:33,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:45:33,507 INFO L82 PathProgramCache]: Analyzing trace with hash 695884557, now seen corresponding path program 1 times [2019-12-07 18:45:33,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:45:33,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217838003] [2019-12-07 18:45:33,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:45:33,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:45:33,557 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 18:45:33,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217838003] [2019-12-07 18:45:33,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:45:33,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:45:33,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587100466] [2019-12-07 18:45:33,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:45:33,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:45:33,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:45:33,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:45:33,559 INFO L87 Difference]: Start difference. First operand 109256 states and 445830 transitions. Second operand 5 states. [2019-12-07 18:45:33,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:45:33,764 INFO L93 Difference]: Finished difference Result 50504 states and 177291 transitions. [2019-12-07 18:45:33,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:45:33,764 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-07 18:45:33,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:45:33,840 INFO L225 Difference]: With dead ends: 50504 [2019-12-07 18:45:33,840 INFO L226 Difference]: Without dead ends: 44150 [2019-12-07 18:45:33,840 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 18:45:34,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44150 states. [2019-12-07 18:45:34,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44150 to 44150. [2019-12-07 18:45:34,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44150 states. [2019-12-07 18:45:34,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44150 states to 44150 states and 152913 transitions. [2019-12-07 18:45:34,757 INFO L78 Accepts]: Start accepts. Automaton has 44150 states and 152913 transitions. Word has length 21 [2019-12-07 18:45:34,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:45:34,758 INFO L462 AbstractCegarLoop]: Abstraction has 44150 states and 152913 transitions. [2019-12-07 18:45:34,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:45:34,758 INFO L276 IsEmpty]: Start isEmpty. Operand 44150 states and 152913 transitions. [2019-12-07 18:45:34,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 18:45:34,761 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:45:34,762 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:45:34,762 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:45:34,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:45:34,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1954811778, now seen corresponding path program 1 times [2019-12-07 18:45:34,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:45:34,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006741734] [2019-12-07 18:45:34,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:45:34,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:45:34,815 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 18:45:34,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006741734] [2019-12-07 18:45:34,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:45:34,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:45:34,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849025922] [2019-12-07 18:45:34,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:45:34,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:45:34,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:45:34,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:45:34,817 INFO L87 Difference]: Start difference. First operand 44150 states and 152913 transitions. Second operand 6 states. [2019-12-07 18:45:34,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:45:34,904 INFO L93 Difference]: Finished difference Result 12102 states and 40971 transitions. [2019-12-07 18:45:34,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:45:34,905 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-07 18:45:34,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:45:34,919 INFO L225 Difference]: With dead ends: 12102 [2019-12-07 18:45:34,919 INFO L226 Difference]: Without dead ends: 9788 [2019-12-07 18:45:34,920 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 18:45:34,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9788 states. [2019-12-07 18:45:35,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9788 to 9788. [2019-12-07 18:45:35,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9788 states. [2019-12-07 18:45:35,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9788 states to 9788 states and 32973 transitions. [2019-12-07 18:45:35,051 INFO L78 Accepts]: Start accepts. Automaton has 9788 states and 32973 transitions. Word has length 22 [2019-12-07 18:45:35,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:45:35,051 INFO L462 AbstractCegarLoop]: Abstraction has 9788 states and 32973 transitions. [2019-12-07 18:45:35,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:45:35,051 INFO L276 IsEmpty]: Start isEmpty. Operand 9788 states and 32973 transitions. [2019-12-07 18:45:35,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 18:45:35,060 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:45:35,060 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:45:35,060 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:45:35,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:45:35,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1880413774, now seen corresponding path program 1 times [2019-12-07 18:45:35,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:45:35,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749962797] [2019-12-07 18:45:35,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:45:35,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:45:35,107 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 18:45:35,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749962797] [2019-12-07 18:45:35,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:45:35,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:45:35,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484182673] [2019-12-07 18:45:35,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:45:35,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:45:35,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:45:35,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:45:35,108 INFO L87 Difference]: Start difference. First operand 9788 states and 32973 transitions. Second operand 5 states. [2019-12-07 18:45:35,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:45:35,362 INFO L93 Difference]: Finished difference Result 10562 states and 34701 transitions. [2019-12-07 18:45:35,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:45:35,363 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-12-07 18:45:35,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:45:35,376 INFO L225 Difference]: With dead ends: 10562 [2019-12-07 18:45:35,376 INFO L226 Difference]: Without dead ends: 10561 [2019-12-07 18:45:35,376 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:45:35,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10561 states. [2019-12-07 18:45:35,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10561 to 10084. [2019-12-07 18:45:35,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10084 states. [2019-12-07 18:45:35,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10084 states to 10084 states and 33636 transitions. [2019-12-07 18:45:35,507 INFO L78 Accepts]: Start accepts. Automaton has 10084 states and 33636 transitions. Word has length 34 [2019-12-07 18:45:35,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:45:35,507 INFO L462 AbstractCegarLoop]: Abstraction has 10084 states and 33636 transitions. [2019-12-07 18:45:35,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:45:35,507 INFO L276 IsEmpty]: Start isEmpty. Operand 10084 states and 33636 transitions. [2019-12-07 18:45:35,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 18:45:35,518 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:45:35,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] [2019-12-07 18:45:35,518 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:45:35,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:45:35,518 INFO L82 PathProgramCache]: Analyzing trace with hash -631099640, now seen corresponding path program 1 times [2019-12-07 18:45:35,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:45:35,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047093028] [2019-12-07 18:45:35,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:45:35,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:45:35,589 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 18:45:35,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047093028] [2019-12-07 18:45:35,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:45:35,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:45:35,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635776947] [2019-12-07 18:45:35,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:45:35,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:45:35,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:45:35,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:45:35,591 INFO L87 Difference]: Start difference. First operand 10084 states and 33636 transitions. Second operand 4 states. [2019-12-07 18:45:35,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:45:35,649 INFO L93 Difference]: Finished difference Result 12005 states and 38633 transitions. [2019-12-07 18:45:35,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:45:35,649 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-07 18:45:35,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:45:35,664 INFO L225 Difference]: With dead ends: 12005 [2019-12-07 18:45:35,664 INFO L226 Difference]: Without dead ends: 11801 [2019-12-07 18:45:35,664 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:45:35,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11801 states. [2019-12-07 18:45:35,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11801 to 11111. [2019-12-07 18:45:35,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11111 states. [2019-12-07 18:45:35,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11111 states to 11111 states and 35981 transitions. [2019-12-07 18:45:35,807 INFO L78 Accepts]: Start accepts. Automaton has 11111 states and 35981 transitions. Word has length 39 [2019-12-07 18:45:35,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:45:35,808 INFO L462 AbstractCegarLoop]: Abstraction has 11111 states and 35981 transitions. [2019-12-07 18:45:35,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:45:35,808 INFO L276 IsEmpty]: Start isEmpty. Operand 11111 states and 35981 transitions. [2019-12-07 18:45:35,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 18:45:35,822 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:45:35,822 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] [2019-12-07 18:45:35,822 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:45:35,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:45:35,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1982369289, now seen corresponding path program 1 times [2019-12-07 18:45:35,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:45:35,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262912056] [2019-12-07 18:45:35,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:45:35,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:45:35,891 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 18:45:35,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262912056] [2019-12-07 18:45:35,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:45:35,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:45:35,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788368418] [2019-12-07 18:45:35,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:45:35,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:45:35,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:45:35,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:45:35,892 INFO L87 Difference]: Start difference. First operand 11111 states and 35981 transitions. Second operand 7 states. [2019-12-07 18:45:35,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:45:35,976 INFO L93 Difference]: Finished difference Result 9339 states and 31906 transitions. [2019-12-07 18:45:35,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:45:35,976 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-12-07 18:45:35,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:45:35,988 INFO L225 Difference]: With dead ends: 9339 [2019-12-07 18:45:35,988 INFO L226 Difference]: Without dead ends: 9131 [2019-12-07 18:45:35,989 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:45:36,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9131 states. [2019-12-07 18:45:36,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9131 to 8527. [2019-12-07 18:45:36,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8527 states. [2019-12-07 18:45:36,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8527 states to 8527 states and 29950 transitions. [2019-12-07 18:45:36,107 INFO L78 Accepts]: Start accepts. Automaton has 8527 states and 29950 transitions. Word has length 48 [2019-12-07 18:45:36,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:45:36,107 INFO L462 AbstractCegarLoop]: Abstraction has 8527 states and 29950 transitions. [2019-12-07 18:45:36,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:45:36,107 INFO L276 IsEmpty]: Start isEmpty. Operand 8527 states and 29950 transitions. [2019-12-07 18:45:36,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 18:45:36,119 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:45:36,119 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 18:45:36,119 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:45:36,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:45:36,119 INFO L82 PathProgramCache]: Analyzing trace with hash -136500077, now seen corresponding path program 1 times [2019-12-07 18:45:36,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:45:36,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944112139] [2019-12-07 18:45:36,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:45:36,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:45:36,175 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 18:45:36,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944112139] [2019-12-07 18:45:36,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:45:36,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:45:36,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314284551] [2019-12-07 18:45:36,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:45:36,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:45:36,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:45:36,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:45:36,176 INFO L87 Difference]: Start difference. First operand 8527 states and 29950 transitions. Second operand 4 states. [2019-12-07 18:45:36,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:45:36,375 INFO L93 Difference]: Finished difference Result 9679 states and 33582 transitions. [2019-12-07 18:45:36,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:45:36,375 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-07 18:45:36,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:45:36,388 INFO L225 Difference]: With dead ends: 9679 [2019-12-07 18:45:36,388 INFO L226 Difference]: Without dead ends: 9679 [2019-12-07 18:45:36,388 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:45:36,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9679 states. [2019-12-07 18:45:36,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9679 to 9487. [2019-12-07 18:45:36,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9487 states. [2019-12-07 18:45:36,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9487 states to 9487 states and 32958 transitions. [2019-12-07 18:45:36,515 INFO L78 Accepts]: Start accepts. Automaton has 9487 states and 32958 transitions. Word has length 65 [2019-12-07 18:45:36,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:45:36,515 INFO L462 AbstractCegarLoop]: Abstraction has 9487 states and 32958 transitions. [2019-12-07 18:45:36,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:45:36,515 INFO L276 IsEmpty]: Start isEmpty. Operand 9487 states and 32958 transitions. [2019-12-07 18:45:36,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 18:45:36,528 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:45:36,528 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 18:45:36,528 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:45:36,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:45:36,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1586420273, now seen corresponding path program 2 times [2019-12-07 18:45:36,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:45:36,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980394399] [2019-12-07 18:45:36,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:45:36,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:45:36,602 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 18:45:36,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980394399] [2019-12-07 18:45:36,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:45:36,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:45:36,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606339206] [2019-12-07 18:45:36,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:45:36,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:45:36,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:45:36,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:45:36,604 INFO L87 Difference]: Start difference. First operand 9487 states and 32958 transitions. Second operand 5 states. [2019-12-07 18:45:36,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:45:36,871 INFO L93 Difference]: Finished difference Result 13050 states and 44976 transitions. [2019-12-07 18:45:36,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:45:36,871 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-07 18:45:36,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:45:36,890 INFO L225 Difference]: With dead ends: 13050 [2019-12-07 18:45:36,890 INFO L226 Difference]: Without dead ends: 13050 [2019-12-07 18:45:36,890 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:45:36,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13050 states. [2019-12-07 18:45:37,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13050 to 10436. [2019-12-07 18:45:37,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10436 states. [2019-12-07 18:45:37,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10436 states to 10436 states and 36238 transitions. [2019-12-07 18:45:37,049 INFO L78 Accepts]: Start accepts. Automaton has 10436 states and 36238 transitions. Word has length 65 [2019-12-07 18:45:37,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:45:37,049 INFO L462 AbstractCegarLoop]: Abstraction has 10436 states and 36238 transitions. [2019-12-07 18:45:37,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:45:37,050 INFO L276 IsEmpty]: Start isEmpty. Operand 10436 states and 36238 transitions. [2019-12-07 18:45:37,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 18:45:37,061 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:45:37,062 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 18:45:37,062 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:45:37,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:45:37,062 INFO L82 PathProgramCache]: Analyzing trace with hash -319679743, now seen corresponding path program 3 times [2019-12-07 18:45:37,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:45:37,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11999359] [2019-12-07 18:45:37,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:45:37,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:45:37,303 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 18:45:37,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11999359] [2019-12-07 18:45:37,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:45:37,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 18:45:37,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198861872] [2019-12-07 18:45:37,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 18:45:37,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:45:37,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 18:45:37,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:45:37,305 INFO L87 Difference]: Start difference. First operand 10436 states and 36238 transitions. Second operand 9 states. [2019-12-07 18:45:38,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:45:38,221 INFO L93 Difference]: Finished difference Result 27545 states and 86993 transitions. [2019-12-07 18:45:38,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 18:45:38,222 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-07 18:45:38,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:45:38,255 INFO L225 Difference]: With dead ends: 27545 [2019-12-07 18:45:38,255 INFO L226 Difference]: Without dead ends: 26135 [2019-12-07 18:45:38,255 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-12-07 18:45:38,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26135 states. [2019-12-07 18:45:38,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26135 to 16530. [2019-12-07 18:45:38,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16530 states. [2019-12-07 18:45:38,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16530 states to 16530 states and 54854 transitions. [2019-12-07 18:45:38,572 INFO L78 Accepts]: Start accepts. Automaton has 16530 states and 54854 transitions. Word has length 65 [2019-12-07 18:45:38,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:45:38,573 INFO L462 AbstractCegarLoop]: Abstraction has 16530 states and 54854 transitions. [2019-12-07 18:45:38,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 18:45:38,573 INFO L276 IsEmpty]: Start isEmpty. Operand 16530 states and 54854 transitions. [2019-12-07 18:45:38,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 18:45:38,590 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:45:38,590 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 18:45:38,590 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:45:38,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:45:38,591 INFO L82 PathProgramCache]: Analyzing trace with hash 2058355659, now seen corresponding path program 4 times [2019-12-07 18:45:38,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:45:38,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200707327] [2019-12-07 18:45:38,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:45:38,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:45:38,672 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 18:45:38,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200707327] [2019-12-07 18:45:38,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:45:38,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:45:38,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579382160] [2019-12-07 18:45:38,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:45:38,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:45:38,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:45:38,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:45:38,674 INFO L87 Difference]: Start difference. First operand 16530 states and 54854 transitions. Second operand 5 states. [2019-12-07 18:45:38,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:45:38,782 INFO L93 Difference]: Finished difference Result 22504 states and 72194 transitions. [2019-12-07 18:45:38,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:45:38,783 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-07 18:45:38,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:45:38,792 INFO L225 Difference]: With dead ends: 22504 [2019-12-07 18:45:38,793 INFO L226 Difference]: Without dead ends: 7426 [2019-12-07 18:45:38,793 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:45:38,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7426 states. [2019-12-07 18:45:38,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7426 to 6574. [2019-12-07 18:45:38,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6574 states. [2019-12-07 18:45:38,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6574 states to 6574 states and 20229 transitions. [2019-12-07 18:45:38,878 INFO L78 Accepts]: Start accepts. Automaton has 6574 states and 20229 transitions. Word has length 65 [2019-12-07 18:45:38,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:45:38,878 INFO L462 AbstractCegarLoop]: Abstraction has 6574 states and 20229 transitions. [2019-12-07 18:45:38,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:45:38,878 INFO L276 IsEmpty]: Start isEmpty. Operand 6574 states and 20229 transitions. [2019-12-07 18:45:38,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 18:45:38,884 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:45:38,884 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 18:45:38,884 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:45:38,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:45:38,884 INFO L82 PathProgramCache]: Analyzing trace with hash 318043693, now seen corresponding path program 5 times [2019-12-07 18:45:38,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:45:38,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718299266] [2019-12-07 18:45:38,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:45:38,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:45:38,943 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 18:45:38,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718299266] [2019-12-07 18:45:38,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:45:38,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:45:38,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812825917] [2019-12-07 18:45:38,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:45:38,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:45:38,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:45:38,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:45:38,944 INFO L87 Difference]: Start difference. First operand 6574 states and 20229 transitions. Second operand 4 states. [2019-12-07 18:45:38,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:45:38,978 INFO L93 Difference]: Finished difference Result 7133 states and 21491 transitions. [2019-12-07 18:45:38,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:45:38,978 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-07 18:45:38,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:45:38,983 INFO L225 Difference]: With dead ends: 7133 [2019-12-07 18:45:38,983 INFO L226 Difference]: Without dead ends: 4034 [2019-12-07 18:45:38,983 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:45:38,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4034 states. [2019-12-07 18:45:39,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4034 to 4034. [2019-12-07 18:45:39,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4034 states. [2019-12-07 18:45:39,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4034 states to 4034 states and 11125 transitions. [2019-12-07 18:45:39,031 INFO L78 Accepts]: Start accepts. Automaton has 4034 states and 11125 transitions. Word has length 65 [2019-12-07 18:45:39,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:45:39,031 INFO L462 AbstractCegarLoop]: Abstraction has 4034 states and 11125 transitions. [2019-12-07 18:45:39,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:45:39,031 INFO L276 IsEmpty]: Start isEmpty. Operand 4034 states and 11125 transitions. [2019-12-07 18:45:39,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 18:45:39,034 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:45:39,034 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 18:45:39,035 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:45:39,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:45:39,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1239097655, now seen corresponding path program 6 times [2019-12-07 18:45:39,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:45:39,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574648639] [2019-12-07 18:45:39,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:45:39,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:45:39,102 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 18:45:39,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574648639] [2019-12-07 18:45:39,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:45:39,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:45:39,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416602998] [2019-12-07 18:45:39,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:45:39,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:45:39,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:45:39,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:45:39,103 INFO L87 Difference]: Start difference. First operand 4034 states and 11125 transitions. Second operand 4 states. [2019-12-07 18:45:39,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:45:39,152 INFO L93 Difference]: Finished difference Result 4821 states and 13282 transitions. [2019-12-07 18:45:39,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:45:39,152 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-07 18:45:39,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:45:39,158 INFO L225 Difference]: With dead ends: 4821 [2019-12-07 18:45:39,158 INFO L226 Difference]: Without dead ends: 4375 [2019-12-07 18:45:39,158 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 18:45:39,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4375 states. [2019-12-07 18:45:39,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4375 to 3683. [2019-12-07 18:45:39,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3683 states. [2019-12-07 18:45:39,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3683 states to 3683 states and 10180 transitions. [2019-12-07 18:45:39,220 INFO L78 Accepts]: Start accepts. Automaton has 3683 states and 10180 transitions. Word has length 65 [2019-12-07 18:45:39,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:45:39,220 INFO L462 AbstractCegarLoop]: Abstraction has 3683 states and 10180 transitions. [2019-12-07 18:45:39,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:45:39,220 INFO L276 IsEmpty]: Start isEmpty. Operand 3683 states and 10180 transitions. [2019-12-07 18:45:39,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 18:45:39,223 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:45:39,224 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 18:45:39,224 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:45:39,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:45:39,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1045053089, now seen corresponding path program 7 times [2019-12-07 18:45:39,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:45:39,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974987394] [2019-12-07 18:45:39,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:45:39,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:45:39,296 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 18:45:39,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974987394] [2019-12-07 18:45:39,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:45:39,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:45:39,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141770395] [2019-12-07 18:45:39,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:45:39,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:45:39,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:45:39,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:45:39,297 INFO L87 Difference]: Start difference. First operand 3683 states and 10180 transitions. Second operand 5 states. [2019-12-07 18:45:39,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:45:39,347 INFO L93 Difference]: Finished difference Result 4422 states and 12191 transitions. [2019-12-07 18:45:39,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:45:39,347 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-07 18:45:39,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:45:39,348 INFO L225 Difference]: With dead ends: 4422 [2019-12-07 18:45:39,348 INFO L226 Difference]: Without dead ends: 484 [2019-12-07 18:45:39,348 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:45:39,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2019-12-07 18:45:39,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 484. [2019-12-07 18:45:39,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-12-07 18:45:39,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 1057 transitions. [2019-12-07 18:45:39,355 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 1057 transitions. Word has length 65 [2019-12-07 18:45:39,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:45:39,355 INFO L462 AbstractCegarLoop]: Abstraction has 484 states and 1057 transitions. [2019-12-07 18:45:39,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:45:39,355 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 1057 transitions. [2019-12-07 18:45:39,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 18:45:39,356 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:45:39,356 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 18:45:39,356 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:45:39,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:45:39,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1736859180, now seen corresponding path program 1 times [2019-12-07 18:45:39,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:45:39,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145156396] [2019-12-07 18:45:39,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:45:39,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:45:39,444 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 18:45:39,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145156396] [2019-12-07 18:45:39,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:45:39,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:45:39,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789730682] [2019-12-07 18:45:39,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:45:39,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:45:39,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:45:39,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:45:39,445 INFO L87 Difference]: Start difference. First operand 484 states and 1057 transitions. Second operand 7 states. [2019-12-07 18:45:39,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:45:39,630 INFO L93 Difference]: Finished difference Result 989 states and 2125 transitions. [2019-12-07 18:45:39,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 18:45:39,630 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-07 18:45:39,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:45:39,631 INFO L225 Difference]: With dead ends: 989 [2019-12-07 18:45:39,631 INFO L226 Difference]: Without dead ends: 738 [2019-12-07 18:45:39,631 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-07 18:45:39,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2019-12-07 18:45:39,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 550. [2019-12-07 18:45:39,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2019-12-07 18:45:39,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 1174 transitions. [2019-12-07 18:45:39,637 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 1174 transitions. Word has length 66 [2019-12-07 18:45:39,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:45:39,637 INFO L462 AbstractCegarLoop]: Abstraction has 550 states and 1174 transitions. [2019-12-07 18:45:39,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:45:39,637 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 1174 transitions. [2019-12-07 18:45:39,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 18:45:39,638 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:45:39,638 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 18:45:39,638 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:45:39,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:45:39,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1869585708, now seen corresponding path program 2 times [2019-12-07 18:45:39,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:45:39,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555735725] [2019-12-07 18:45:39,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:45:39,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:45:39,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:45:39,713 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:45:39,713 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 18:45:39,716 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1061] [1061] ULTIMATE.startENTRY-->L856: Formula: (let ((.cse0 (store |v_#valid_86| 0 0))) (and (= v_~z$r_buff0_thd1~0_96 0) (= 0 v_~z$mem_tmp~0_203) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff1_thd1~0_165 0) (= v_~main$tmp_guard1~0_48 0) (= 0 v_~z$flush_delayed~0_235) (= 0 v_~__unbuffered_p1_EAX~0_61) (= |v_#memory_int_29| (store |v_#memory_int_30| |v_ULTIMATE.start_main_~#t133~0.base_40| (store (select |v_#memory_int_30| |v_ULTIMATE.start_main_~#t133~0.base_40|) |v_ULTIMATE.start_main_~#t133~0.offset_26| 0))) (= 0 v_~z$r_buff0_thd4~0_512) (= 0 v_~__unbuffered_p3_EBX~0_56) (= 0 v_~z$r_buff0_thd3~0_418) (= v_~a~0_28 0) (= v_~z$w_buff0_used~0_907 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~weak$$choice2~0_286 0) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~__unbuffered_p3_EAX~0_62) (= 0 |v_ULTIMATE.start_main_~#t133~0.offset_26|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t133~0.base_40|)) (= v_~z$w_buff0~0_341 0) (= v_~y~0_56 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t133~0.base_40|) (= 0 v_~__unbuffered_p2_EAX~0_71) (= v_~z$read_delayed~0_7 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t133~0.base_40| 1) |v_#valid_84|) (= v_~z$r_buff0_thd0~0_165 0) (= v_~__unbuffered_p2_EBX~0_75 0) (= v_~z$r_buff1_thd0~0_251 0) (= |v_#NULL.offset_5| 0) (= 0 v_~z$r_buff1_thd3~0_405) (= v_~z$r_buff0_thd2~0_96 0) (= 0 v_~weak$$choice0~0_191) (= v_~__unbuffered_cnt~0_139 0) (= v_~z$w_buff1~0_234 0) (= v_~x~0_74 0) (= v_~z$w_buff1_used~0_667 0) (= v_~z$r_buff1_thd2~0_165 0) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t133~0.base_40| 4)) (= 0 |v_#NULL.base_5|) (= 0 v_~z$r_buff1_thd4~0_334) (= v_~z~0_304 0) (= v_~main$tmp_guard0~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_86|, #memory_int=|v_#memory_int_30|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_8|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_165, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_96|, ~a~0=v_~a~0_28, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_165, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_61, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_512, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_62, ULTIMATE.start_main_~#t135~0.base=|v_ULTIMATE.start_main_~#t135~0.base_23|, #length=|v_#length_29|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_71, ULTIMATE.start_main_~#t134~0.offset=|v_ULTIMATE.start_main_~#t134~0.offset_22|, ~z$mem_tmp~0=v_~z$mem_tmp~0_203, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_75, ULTIMATE.start_main_~#t136~0.base=|v_ULTIMATE.start_main_~#t136~0.base_24|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_667, ~z$flush_delayed~0=v_~z$flush_delayed~0_235, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_28|, ~weak$$choice0~0=v_~weak$$choice0~0_191, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_206|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_165, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_418, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_139, ULTIMATE.start_main_~#t136~0.offset=|v_ULTIMATE.start_main_~#t136~0.offset_18|, ~x~0=v_~x~0_74, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_334, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_21|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_8|, ULTIMATE.start_main_~#t135~0.offset=|v_ULTIMATE.start_main_~#t135~0.offset_18|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_234, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_48, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_251, ~y~0=v_~y~0_56, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_96, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_907, ~z$w_buff0~0=v_~z$w_buff0~0_341, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_405, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_68|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_37, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_56, ULTIMATE.start_main_~#t133~0.base=|v_ULTIMATE.start_main_~#t133~0.base_40|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_~#t133~0.offset=|v_ULTIMATE.start_main_~#t133~0.offset_26|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_80|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_97|, ULTIMATE.start_main_~#t134~0.base=|v_ULTIMATE.start_main_~#t134~0.base_32|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, #valid=|v_#valid_84|, #memory_int=|v_#memory_int_29|, ~z~0=v_~z~0_304, ~weak$$choice2~0=v_~weak$$choice2~0_286, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_96} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_#t~ite64, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, ULTIMATE.start_main_~#t135~0.base, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t134~0.offset, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_~#t136~0.base, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t136~0.offset, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ULTIMATE.start_main_~#t135~0.offset, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t133~0.base, #NULL.base, ULTIMATE.start_main_~#t133~0.offset, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_~#t134~0.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 18:45:39,716 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1033] [1033] L856-1-->L858: Formula: (and (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t134~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t134~0.base_11|) |v_ULTIMATE.start_main_~#t134~0.offset_10| 1)) |v_#memory_int_19|) (= |v_#valid_44| (store |v_#valid_45| |v_ULTIMATE.start_main_~#t134~0.base_11| 1)) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t134~0.base_11| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t134~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t134~0.offset_10|) (not (= 0 |v_ULTIMATE.start_main_~#t134~0.base_11|)) (= 0 (select |v_#valid_45| |v_ULTIMATE.start_main_~#t134~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_20|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t134~0.base=|v_ULTIMATE.start_main_~#t134~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_19|, #length=|v_#length_19|, ULTIMATE.start_main_~#t134~0.offset=|v_ULTIMATE.start_main_~#t134~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t134~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t134~0.offset] because there is no mapped edge [2019-12-07 18:45:39,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1035] [1035] L858-1-->L860: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t135~0.offset_11|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t135~0.base_12|) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t135~0.base_12| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t135~0.base_12|) |v_ULTIMATE.start_main_~#t135~0.offset_11| 2))) (not (= |v_ULTIMATE.start_main_~#t135~0.base_12| 0)) (= (select |v_#valid_49| |v_ULTIMATE.start_main_~#t135~0.base_12|) 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t135~0.base_12| 4)) (= (store |v_#valid_49| |v_ULTIMATE.start_main_~#t135~0.base_12| 1) |v_#valid_48|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_22|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_48|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~#t135~0.offset=|v_ULTIMATE.start_main_~#t135~0.offset_11|, ULTIMATE.start_main_~#t135~0.base=|v_ULTIMATE.start_main_~#t135~0.base_12|, #length=|v_#length_21|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t135~0.offset, ULTIMATE.start_main_~#t135~0.base, #length] because there is no mapped edge [2019-12-07 18:45:39,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1037] [1037] L860-1-->L862: Formula: (and (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t136~0.base_13| 4) |v_#length_23|) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t136~0.base_13| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t136~0.base_13|) |v_ULTIMATE.start_main_~#t136~0.offset_11| 3)) |v_#memory_int_23|) (= 0 |v_ULTIMATE.start_main_~#t136~0.offset_11|) (= 0 (select |v_#valid_51| |v_ULTIMATE.start_main_~#t136~0.base_13|)) (not (= 0 |v_ULTIMATE.start_main_~#t136~0.base_13|)) (= |v_#valid_50| (store |v_#valid_51| |v_ULTIMATE.start_main_~#t136~0.base_13| 1)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t136~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_5|, ULTIMATE.start_main_~#t136~0.base=|v_ULTIMATE.start_main_~#t136~0.base_13|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_23|, #length=|v_#length_23|, ULTIMATE.start_main_~#t136~0.offset=|v_ULTIMATE.start_main_~#t136~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_~#t136~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t136~0.offset] because there is no mapped edge [2019-12-07 18:45:39,718 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [907] [907] P3ENTRY-->L4-3: Formula: (and (= 1 v_~z$w_buff0~0_34) (= v_~z$w_buff0~0_35 v_~z$w_buff1~0_22) (= |v_P3Thread1of1ForFork2_#in~arg.offset_9| v_P3Thread1of1ForFork2_~arg.offset_7) (= (ite (not (and (not (= (mod v_~z$w_buff0_used~0_105 256) 0)) (not (= (mod v_~z$w_buff1_used~0_57 256) 0)))) 1 0) |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_7|) (not (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_9 0)) (= v_P3Thread1of1ForFork2_~arg.base_7 |v_P3Thread1of1ForFork2_#in~arg.base_9|) (= v_~z$w_buff0_used~0_106 v_~z$w_buff1_used~0_57) (= v_~z$w_buff0_used~0_105 1) (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_9 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_7|)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_106, ~z$w_buff0~0=v_~z$w_buff0~0_35, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_9|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_9|} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_9, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_7, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_105, ~z$w_buff0~0=v_~z$w_buff0~0_34, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_57, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_9|, ~z$w_buff1~0=v_~z$w_buff1~0_22, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_7|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_7, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_9|} AuxVars[] AssignedVars[P3Thread1of1ForFork2___VERIFIER_assert_~expression, P3Thread1of1ForFork2_~arg.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression, P3Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-07 18:45:39,719 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L818-2-->L818-5: Formula: (let ((.cse0 (= |P3Thread1of1ForFork2_#t~ite29_Out-1137937762| |P3Thread1of1ForFork2_#t~ite28_Out-1137937762|)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1137937762 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In-1137937762 256)))) (or (and .cse0 (= ~z$w_buff1~0_In-1137937762 |P3Thread1of1ForFork2_#t~ite28_Out-1137937762|) (or .cse1 .cse2)) (and .cse0 (not .cse1) (not .cse2) (= ~z$w_buff0~0_In-1137937762 |P3Thread1of1ForFork2_#t~ite28_Out-1137937762|)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-1137937762, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1137937762, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1137937762, ~z$w_buff1~0=~z$w_buff1~0_In-1137937762} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-1137937762|, P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-1137937762|, ~z$w_buff0~0=~z$w_buff0~0_In-1137937762, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1137937762, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1137937762, ~z$w_buff1~0=~z$w_buff1~0_In-1137937762} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 18:45:39,722 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [942] [942] L823-->L824: Formula: (and (= v_~z$r_buff0_thd4~0_105 v_~z$r_buff0_thd4~0_104) (not (= 0 (mod v_~weak$$choice2~0_68 256)))) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_105, ~weak$$choice2~0=v_~weak$$choice2~0_68} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_6|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_9|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_104, ~weak$$choice2~0=v_~weak$$choice2~0_68} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite42, P3Thread1of1ForFork2_#t~ite43, P3Thread1of1ForFork2_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 18:45:39,723 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L826-->L826-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-1287817719 256)))) (or (and .cse0 (= ~z~0_In-1287817719 |P3Thread1of1ForFork2_#t~ite48_Out-1287817719|)) (and (not .cse0) (= |P3Thread1of1ForFork2_#t~ite48_Out-1287817719| ~z$mem_tmp~0_In-1287817719)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-1287817719, ~z$flush_delayed~0=~z$flush_delayed~0_In-1287817719, ~z~0=~z~0_In-1287817719} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-1287817719, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out-1287817719|, ~z$flush_delayed~0=~z$flush_delayed~0_In-1287817719, ~z~0=~z~0_In-1287817719} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-07 18:45:39,723 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1028] [1028] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= v_~a~0_16 1) (= v_~x~0_21 1) (= |v_P0Thread1of1ForFork3_#in~arg.offset_10| v_P0Thread1of1ForFork3_~arg.offset_8) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0) (= v_P0Thread1of1ForFork3_~arg.base_8 |v_P0Thread1of1ForFork3_#in~arg.base_10|)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|} OutVars{~a~0=v_~a~0_16, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_8, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_8, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|, ~x~0=v_~x~0_21} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset, ~x~0] because there is no mapped edge [2019-12-07 18:45:39,723 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1027] [1027] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_6|) (= (+ v_~__unbuffered_cnt~0_66 1) v_~__unbuffered_cnt~0_65) (= v_~x~0_18 2) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_6|) (= v_~y~0_31 v_~__unbuffered_p1_EAX~0_15)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66, ~y~0=v_~y~0_31} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, ~y~0=v_~y~0_31, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|, ~x~0=v_~x~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 18:45:39,730 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L788-->L788-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-940129828 256) 0))) (or (and .cse0 (= ~z~0_In-940129828 |P2Thread1of1ForFork1_#t~ite25_Out-940129828|)) (and (= ~z$mem_tmp~0_In-940129828 |P2Thread1of1ForFork1_#t~ite25_Out-940129828|) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-940129828, ~z$flush_delayed~0=~z$flush_delayed~0_In-940129828, ~z~0=~z~0_In-940129828} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-940129828, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out-940129828|, ~z$flush_delayed~0=~z$flush_delayed~0_In-940129828, ~z~0=~z~0_In-940129828} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 18:45:39,731 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [997] [997] L834-->L834-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-2033353551 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-2033353551 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite51_Out-2033353551| ~z$w_buff0_used~0_In-2033353551) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P3Thread1of1ForFork2_#t~ite51_Out-2033353551| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2033353551, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2033353551} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out-2033353551|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2033353551, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2033353551} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 18:45:39,731 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L835-->L835-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In-1862175402 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd4~0_In-1862175402 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1862175402 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-1862175402 256)))) (or (and (= 0 |P3Thread1of1ForFork2_#t~ite52_Out-1862175402|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P3Thread1of1ForFork2_#t~ite52_Out-1862175402| ~z$w_buff1_used~0_In-1862175402) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1862175402, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1862175402, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1862175402, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1862175402} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out-1862175402|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1862175402, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1862175402, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1862175402, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1862175402} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-07 18:45:39,732 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L836-->L837: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1225621568 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd4~0_In1225621568 256) 0)) (.cse2 (= ~z$r_buff0_thd4~0_Out1225621568 ~z$r_buff0_thd4~0_In1225621568))) (or (and (= 0 ~z$r_buff0_thd4~0_Out1225621568) (not .cse0) (not .cse1)) (and .cse1 .cse2) (and .cse0 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1225621568, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1225621568} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out1225621568|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1225621568, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1225621568} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 18:45:39,732 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [981] [981] L837-->L837-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd4~0_In-1349760848 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1349760848 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1349760848 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd4~0_In-1349760848 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite54_Out-1349760848| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~z$r_buff1_thd4~0_In-1349760848 |P3Thread1of1ForFork2_#t~ite54_Out-1349760848|) (or .cse2 .cse3)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1349760848, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1349760848, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1349760848, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1349760848} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out-1349760848|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1349760848, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1349760848, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1349760848, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1349760848} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-07 18:45:39,732 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1032] [1032] L837-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork2_#t~ite54_30| v_~z$r_buff1_thd4~0_260) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_29|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_260, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54, P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 18:45:39,732 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] L788-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 v_~z$flush_delayed~0_189) (= v_~z~0_189 |v_P2Thread1of1ForFork1_#t~ite25_44|) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_43|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ~z$flush_delayed~0=v_~z$flush_delayed~0_189, ~z~0=v_~z~0_189, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 18:45:39,733 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [908] [908] L866-->L868-2: Formula: (and (or (= (mod v_~z$w_buff0_used~0_107 256) 0) (= 0 (mod v_~z$r_buff0_thd0~0_14 256))) (not (= (mod v_~main$tmp_guard0~0_4 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_107, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_107, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 18:45:39,733 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [980] [980] L868-2-->L868-5: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In755505521 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In755505521 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite59_Out755505521| |ULTIMATE.start_main_#t~ite60_Out755505521|))) (or (and (= |ULTIMATE.start_main_#t~ite59_Out755505521| ~z~0_In755505521) (or .cse0 .cse1) .cse2) (and (= |ULTIMATE.start_main_#t~ite59_Out755505521| ~z$w_buff1~0_In755505521) (not .cse0) (not .cse1) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In755505521, ~z$w_buff1_used~0=~z$w_buff1_used~0_In755505521, ~z$w_buff1~0=~z$w_buff1~0_In755505521, ~z~0=~z~0_In755505521} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out755505521|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In755505521, ~z$w_buff1_used~0=~z$w_buff1_used~0_In755505521, ~z$w_buff1~0=~z$w_buff1~0_In755505521, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out755505521|, ~z~0=~z~0_In755505521} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 18:45:39,733 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L869-->L869-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1775511296 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1775511296 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite61_Out1775511296| ~z$w_buff0_used~0_In1775511296) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite61_Out1775511296| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1775511296, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1775511296} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1775511296, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out1775511296|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1775511296} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 18:45:39,734 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] L870-->L870-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-648188627 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-648188627 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-648188627 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-648188627 256)))) (or (and (= |ULTIMATE.start_main_#t~ite62_Out-648188627| ~z$w_buff1_used~0_In-648188627) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite62_Out-648188627|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-648188627, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-648188627, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-648188627, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-648188627} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-648188627|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-648188627, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-648188627, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-648188627, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-648188627} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 18:45:39,734 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] L871-->L871-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-2112533667 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-2112533667 256) 0))) (or (and (= ~z$r_buff0_thd0~0_In-2112533667 |ULTIMATE.start_main_#t~ite63_Out-2112533667|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite63_Out-2112533667|) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2112533667, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2112533667} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-2112533667|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2112533667, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2112533667} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 18:45:39,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [987] [987] L872-->L872-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd0~0_In1430794820 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1430794820 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In1430794820 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1430794820 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite64_Out1430794820|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite64_Out1430794820| ~z$r_buff1_thd0~0_In1430794820)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1430794820, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1430794820, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1430794820, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1430794820} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1430794820, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1430794820, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1430794820, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1430794820, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out1430794820|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 18:45:39,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1049] [1049] L872-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_18 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p3_EAX~0_28) (= 0 v_~__unbuffered_p1_EAX~0_27) (= 1 v_~__unbuffered_p2_EAX~0_41) (= 0 v_~__unbuffered_p3_EBX~0_24) (= v_~__unbuffered_p2_EBX~0_43 0) (= v_~x~0_36 2))) 1 0)) 0 1) v_~main$tmp_guard1~0_18) (= v_~z$r_buff1_thd0~0_221 |v_ULTIMATE.start_main_#t~ite64_41|)) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_43, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_28, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_41, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~x~0=v_~x~0_36, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_41|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_43, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_221, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_41, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~x~0=v_~x~0_36, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_40|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 18:45:39,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:45:39 BasicIcfg [2019-12-07 18:45:39,804 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:45:39,804 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:45:39,804 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:45:39,804 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:45:39,804 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:44:51" (3/4) ... [2019-12-07 18:45:39,806 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 18:45:39,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1061] [1061] ULTIMATE.startENTRY-->L856: Formula: (let ((.cse0 (store |v_#valid_86| 0 0))) (and (= v_~z$r_buff0_thd1~0_96 0) (= 0 v_~z$mem_tmp~0_203) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff1_thd1~0_165 0) (= v_~main$tmp_guard1~0_48 0) (= 0 v_~z$flush_delayed~0_235) (= 0 v_~__unbuffered_p1_EAX~0_61) (= |v_#memory_int_29| (store |v_#memory_int_30| |v_ULTIMATE.start_main_~#t133~0.base_40| (store (select |v_#memory_int_30| |v_ULTIMATE.start_main_~#t133~0.base_40|) |v_ULTIMATE.start_main_~#t133~0.offset_26| 0))) (= 0 v_~z$r_buff0_thd4~0_512) (= 0 v_~__unbuffered_p3_EBX~0_56) (= 0 v_~z$r_buff0_thd3~0_418) (= v_~a~0_28 0) (= v_~z$w_buff0_used~0_907 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~weak$$choice2~0_286 0) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~__unbuffered_p3_EAX~0_62) (= 0 |v_ULTIMATE.start_main_~#t133~0.offset_26|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t133~0.base_40|)) (= v_~z$w_buff0~0_341 0) (= v_~y~0_56 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t133~0.base_40|) (= 0 v_~__unbuffered_p2_EAX~0_71) (= v_~z$read_delayed~0_7 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t133~0.base_40| 1) |v_#valid_84|) (= v_~z$r_buff0_thd0~0_165 0) (= v_~__unbuffered_p2_EBX~0_75 0) (= v_~z$r_buff1_thd0~0_251 0) (= |v_#NULL.offset_5| 0) (= 0 v_~z$r_buff1_thd3~0_405) (= v_~z$r_buff0_thd2~0_96 0) (= 0 v_~weak$$choice0~0_191) (= v_~__unbuffered_cnt~0_139 0) (= v_~z$w_buff1~0_234 0) (= v_~x~0_74 0) (= v_~z$w_buff1_used~0_667 0) (= v_~z$r_buff1_thd2~0_165 0) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t133~0.base_40| 4)) (= 0 |v_#NULL.base_5|) (= 0 v_~z$r_buff1_thd4~0_334) (= v_~z~0_304 0) (= v_~main$tmp_guard0~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_86|, #memory_int=|v_#memory_int_30|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_8|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_165, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_96|, ~a~0=v_~a~0_28, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_165, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_61, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_512, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_62, ULTIMATE.start_main_~#t135~0.base=|v_ULTIMATE.start_main_~#t135~0.base_23|, #length=|v_#length_29|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_71, ULTIMATE.start_main_~#t134~0.offset=|v_ULTIMATE.start_main_~#t134~0.offset_22|, ~z$mem_tmp~0=v_~z$mem_tmp~0_203, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_75, ULTIMATE.start_main_~#t136~0.base=|v_ULTIMATE.start_main_~#t136~0.base_24|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_667, ~z$flush_delayed~0=v_~z$flush_delayed~0_235, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_28|, ~weak$$choice0~0=v_~weak$$choice0~0_191, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_206|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_165, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_418, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_139, ULTIMATE.start_main_~#t136~0.offset=|v_ULTIMATE.start_main_~#t136~0.offset_18|, ~x~0=v_~x~0_74, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_334, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_21|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_8|, ULTIMATE.start_main_~#t135~0.offset=|v_ULTIMATE.start_main_~#t135~0.offset_18|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_234, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_48, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_251, ~y~0=v_~y~0_56, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_96, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_907, ~z$w_buff0~0=v_~z$w_buff0~0_341, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_405, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_68|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_37, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_56, ULTIMATE.start_main_~#t133~0.base=|v_ULTIMATE.start_main_~#t133~0.base_40|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_~#t133~0.offset=|v_ULTIMATE.start_main_~#t133~0.offset_26|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_80|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_97|, ULTIMATE.start_main_~#t134~0.base=|v_ULTIMATE.start_main_~#t134~0.base_32|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, #valid=|v_#valid_84|, #memory_int=|v_#memory_int_29|, ~z~0=v_~z~0_304, ~weak$$choice2~0=v_~weak$$choice2~0_286, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_96} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_#t~ite64, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, ULTIMATE.start_main_~#t135~0.base, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t134~0.offset, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_~#t136~0.base, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t136~0.offset, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ULTIMATE.start_main_~#t135~0.offset, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t133~0.base, #NULL.base, ULTIMATE.start_main_~#t133~0.offset, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_~#t134~0.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 18:45:39,807 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1033] [1033] L856-1-->L858: Formula: (and (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t134~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t134~0.base_11|) |v_ULTIMATE.start_main_~#t134~0.offset_10| 1)) |v_#memory_int_19|) (= |v_#valid_44| (store |v_#valid_45| |v_ULTIMATE.start_main_~#t134~0.base_11| 1)) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t134~0.base_11| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t134~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t134~0.offset_10|) (not (= 0 |v_ULTIMATE.start_main_~#t134~0.base_11|)) (= 0 (select |v_#valid_45| |v_ULTIMATE.start_main_~#t134~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_20|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t134~0.base=|v_ULTIMATE.start_main_~#t134~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_19|, #length=|v_#length_19|, ULTIMATE.start_main_~#t134~0.offset=|v_ULTIMATE.start_main_~#t134~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t134~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t134~0.offset] because there is no mapped edge [2019-12-07 18:45:39,807 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1035] [1035] L858-1-->L860: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t135~0.offset_11|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t135~0.base_12|) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t135~0.base_12| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t135~0.base_12|) |v_ULTIMATE.start_main_~#t135~0.offset_11| 2))) (not (= |v_ULTIMATE.start_main_~#t135~0.base_12| 0)) (= (select |v_#valid_49| |v_ULTIMATE.start_main_~#t135~0.base_12|) 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t135~0.base_12| 4)) (= (store |v_#valid_49| |v_ULTIMATE.start_main_~#t135~0.base_12| 1) |v_#valid_48|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_22|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_48|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~#t135~0.offset=|v_ULTIMATE.start_main_~#t135~0.offset_11|, ULTIMATE.start_main_~#t135~0.base=|v_ULTIMATE.start_main_~#t135~0.base_12|, #length=|v_#length_21|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t135~0.offset, ULTIMATE.start_main_~#t135~0.base, #length] because there is no mapped edge [2019-12-07 18:45:39,808 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1037] [1037] L860-1-->L862: Formula: (and (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t136~0.base_13| 4) |v_#length_23|) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t136~0.base_13| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t136~0.base_13|) |v_ULTIMATE.start_main_~#t136~0.offset_11| 3)) |v_#memory_int_23|) (= 0 |v_ULTIMATE.start_main_~#t136~0.offset_11|) (= 0 (select |v_#valid_51| |v_ULTIMATE.start_main_~#t136~0.base_13|)) (not (= 0 |v_ULTIMATE.start_main_~#t136~0.base_13|)) (= |v_#valid_50| (store |v_#valid_51| |v_ULTIMATE.start_main_~#t136~0.base_13| 1)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t136~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_5|, ULTIMATE.start_main_~#t136~0.base=|v_ULTIMATE.start_main_~#t136~0.base_13|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_23|, #length=|v_#length_23|, ULTIMATE.start_main_~#t136~0.offset=|v_ULTIMATE.start_main_~#t136~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_~#t136~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t136~0.offset] because there is no mapped edge [2019-12-07 18:45:39,808 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [907] [907] P3ENTRY-->L4-3: Formula: (and (= 1 v_~z$w_buff0~0_34) (= v_~z$w_buff0~0_35 v_~z$w_buff1~0_22) (= |v_P3Thread1of1ForFork2_#in~arg.offset_9| v_P3Thread1of1ForFork2_~arg.offset_7) (= (ite (not (and (not (= (mod v_~z$w_buff0_used~0_105 256) 0)) (not (= (mod v_~z$w_buff1_used~0_57 256) 0)))) 1 0) |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_7|) (not (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_9 0)) (= v_P3Thread1of1ForFork2_~arg.base_7 |v_P3Thread1of1ForFork2_#in~arg.base_9|) (= v_~z$w_buff0_used~0_106 v_~z$w_buff1_used~0_57) (= v_~z$w_buff0_used~0_105 1) (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_9 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_7|)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_106, ~z$w_buff0~0=v_~z$w_buff0~0_35, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_9|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_9|} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_9, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_7, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_105, ~z$w_buff0~0=v_~z$w_buff0~0_34, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_57, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_9|, ~z$w_buff1~0=v_~z$w_buff1~0_22, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_7|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_7, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_9|} AuxVars[] AssignedVars[P3Thread1of1ForFork2___VERIFIER_assert_~expression, P3Thread1of1ForFork2_~arg.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression, P3Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-07 18:45:39,809 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L818-2-->L818-5: Formula: (let ((.cse0 (= |P3Thread1of1ForFork2_#t~ite29_Out-1137937762| |P3Thread1of1ForFork2_#t~ite28_Out-1137937762|)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1137937762 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In-1137937762 256)))) (or (and .cse0 (= ~z$w_buff1~0_In-1137937762 |P3Thread1of1ForFork2_#t~ite28_Out-1137937762|) (or .cse1 .cse2)) (and .cse0 (not .cse1) (not .cse2) (= ~z$w_buff0~0_In-1137937762 |P3Thread1of1ForFork2_#t~ite28_Out-1137937762|)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-1137937762, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1137937762, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1137937762, ~z$w_buff1~0=~z$w_buff1~0_In-1137937762} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-1137937762|, P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-1137937762|, ~z$w_buff0~0=~z$w_buff0~0_In-1137937762, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1137937762, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1137937762, ~z$w_buff1~0=~z$w_buff1~0_In-1137937762} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 18:45:39,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [942] [942] L823-->L824: Formula: (and (= v_~z$r_buff0_thd4~0_105 v_~z$r_buff0_thd4~0_104) (not (= 0 (mod v_~weak$$choice2~0_68 256)))) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_105, ~weak$$choice2~0=v_~weak$$choice2~0_68} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_6|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_9|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_104, ~weak$$choice2~0=v_~weak$$choice2~0_68} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite42, P3Thread1of1ForFork2_#t~ite43, P3Thread1of1ForFork2_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 18:45:39,813 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L826-->L826-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-1287817719 256)))) (or (and .cse0 (= ~z~0_In-1287817719 |P3Thread1of1ForFork2_#t~ite48_Out-1287817719|)) (and (not .cse0) (= |P3Thread1of1ForFork2_#t~ite48_Out-1287817719| ~z$mem_tmp~0_In-1287817719)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-1287817719, ~z$flush_delayed~0=~z$flush_delayed~0_In-1287817719, ~z~0=~z~0_In-1287817719} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-1287817719, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out-1287817719|, ~z$flush_delayed~0=~z$flush_delayed~0_In-1287817719, ~z~0=~z~0_In-1287817719} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-07 18:45:39,813 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1028] [1028] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= v_~a~0_16 1) (= v_~x~0_21 1) (= |v_P0Thread1of1ForFork3_#in~arg.offset_10| v_P0Thread1of1ForFork3_~arg.offset_8) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0) (= v_P0Thread1of1ForFork3_~arg.base_8 |v_P0Thread1of1ForFork3_#in~arg.base_10|)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|} OutVars{~a~0=v_~a~0_16, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_8, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_8, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|, ~x~0=v_~x~0_21} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset, ~x~0] because there is no mapped edge [2019-12-07 18:45:39,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1027] [1027] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_6|) (= (+ v_~__unbuffered_cnt~0_66 1) v_~__unbuffered_cnt~0_65) (= v_~x~0_18 2) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_6|) (= v_~y~0_31 v_~__unbuffered_p1_EAX~0_15)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66, ~y~0=v_~y~0_31} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, ~y~0=v_~y~0_31, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|, ~x~0=v_~x~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 18:45:39,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L788-->L788-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-940129828 256) 0))) (or (and .cse0 (= ~z~0_In-940129828 |P2Thread1of1ForFork1_#t~ite25_Out-940129828|)) (and (= ~z$mem_tmp~0_In-940129828 |P2Thread1of1ForFork1_#t~ite25_Out-940129828|) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-940129828, ~z$flush_delayed~0=~z$flush_delayed~0_In-940129828, ~z~0=~z~0_In-940129828} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-940129828, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out-940129828|, ~z$flush_delayed~0=~z$flush_delayed~0_In-940129828, ~z~0=~z~0_In-940129828} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 18:45:39,821 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [997] [997] L834-->L834-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-2033353551 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-2033353551 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite51_Out-2033353551| ~z$w_buff0_used~0_In-2033353551) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P3Thread1of1ForFork2_#t~ite51_Out-2033353551| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2033353551, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2033353551} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out-2033353551|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2033353551, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2033353551} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 18:45:39,821 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L835-->L835-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In-1862175402 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd4~0_In-1862175402 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1862175402 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-1862175402 256)))) (or (and (= 0 |P3Thread1of1ForFork2_#t~ite52_Out-1862175402|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P3Thread1of1ForFork2_#t~ite52_Out-1862175402| ~z$w_buff1_used~0_In-1862175402) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1862175402, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1862175402, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1862175402, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1862175402} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out-1862175402|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1862175402, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1862175402, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1862175402, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1862175402} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-07 18:45:39,822 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L836-->L837: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1225621568 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd4~0_In1225621568 256) 0)) (.cse2 (= ~z$r_buff0_thd4~0_Out1225621568 ~z$r_buff0_thd4~0_In1225621568))) (or (and (= 0 ~z$r_buff0_thd4~0_Out1225621568) (not .cse0) (not .cse1)) (and .cse1 .cse2) (and .cse0 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1225621568, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1225621568} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out1225621568|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1225621568, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1225621568} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 18:45:39,822 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [981] [981] L837-->L837-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd4~0_In-1349760848 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1349760848 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1349760848 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd4~0_In-1349760848 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite54_Out-1349760848| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~z$r_buff1_thd4~0_In-1349760848 |P3Thread1of1ForFork2_#t~ite54_Out-1349760848|) (or .cse2 .cse3)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1349760848, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1349760848, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1349760848, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1349760848} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out-1349760848|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1349760848, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1349760848, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1349760848, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1349760848} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-07 18:45:39,822 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1032] [1032] L837-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork2_#t~ite54_30| v_~z$r_buff1_thd4~0_260) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_29|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_260, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54, P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 18:45:39,822 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] L788-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 v_~z$flush_delayed~0_189) (= v_~z~0_189 |v_P2Thread1of1ForFork1_#t~ite25_44|) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_43|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ~z$flush_delayed~0=v_~z$flush_delayed~0_189, ~z~0=v_~z~0_189, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 18:45:39,823 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [908] [908] L866-->L868-2: Formula: (and (or (= (mod v_~z$w_buff0_used~0_107 256) 0) (= 0 (mod v_~z$r_buff0_thd0~0_14 256))) (not (= (mod v_~main$tmp_guard0~0_4 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_107, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_107, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 18:45:39,823 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [980] [980] L868-2-->L868-5: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In755505521 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In755505521 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite59_Out755505521| |ULTIMATE.start_main_#t~ite60_Out755505521|))) (or (and (= |ULTIMATE.start_main_#t~ite59_Out755505521| ~z~0_In755505521) (or .cse0 .cse1) .cse2) (and (= |ULTIMATE.start_main_#t~ite59_Out755505521| ~z$w_buff1~0_In755505521) (not .cse0) (not .cse1) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In755505521, ~z$w_buff1_used~0=~z$w_buff1_used~0_In755505521, ~z$w_buff1~0=~z$w_buff1~0_In755505521, ~z~0=~z~0_In755505521} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out755505521|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In755505521, ~z$w_buff1_used~0=~z$w_buff1_used~0_In755505521, ~z$w_buff1~0=~z$w_buff1~0_In755505521, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out755505521|, ~z~0=~z~0_In755505521} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 18:45:39,823 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L869-->L869-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1775511296 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1775511296 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite61_Out1775511296| ~z$w_buff0_used~0_In1775511296) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite61_Out1775511296| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1775511296, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1775511296} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1775511296, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out1775511296|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1775511296} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 18:45:39,824 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] L870-->L870-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-648188627 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-648188627 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-648188627 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-648188627 256)))) (or (and (= |ULTIMATE.start_main_#t~ite62_Out-648188627| ~z$w_buff1_used~0_In-648188627) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite62_Out-648188627|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-648188627, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-648188627, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-648188627, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-648188627} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-648188627|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-648188627, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-648188627, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-648188627, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-648188627} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 18:45:39,824 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] L871-->L871-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-2112533667 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-2112533667 256) 0))) (or (and (= ~z$r_buff0_thd0~0_In-2112533667 |ULTIMATE.start_main_#t~ite63_Out-2112533667|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite63_Out-2112533667|) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2112533667, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2112533667} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-2112533667|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2112533667, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2112533667} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 18:45:39,825 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [987] [987] L872-->L872-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd0~0_In1430794820 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1430794820 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In1430794820 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1430794820 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite64_Out1430794820|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite64_Out1430794820| ~z$r_buff1_thd0~0_In1430794820)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1430794820, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1430794820, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1430794820, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1430794820} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1430794820, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1430794820, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1430794820, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1430794820, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out1430794820|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 18:45:39,825 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1049] [1049] L872-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_18 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p3_EAX~0_28) (= 0 v_~__unbuffered_p1_EAX~0_27) (= 1 v_~__unbuffered_p2_EAX~0_41) (= 0 v_~__unbuffered_p3_EBX~0_24) (= v_~__unbuffered_p2_EBX~0_43 0) (= v_~x~0_36 2))) 1 0)) 0 1) v_~main$tmp_guard1~0_18) (= v_~z$r_buff1_thd0~0_221 |v_ULTIMATE.start_main_#t~ite64_41|)) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_43, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_28, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_41, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~x~0=v_~x~0_36, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_41|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_43, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_221, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_41, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~x~0=v_~x~0_36, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_40|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 18:45:39,893 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_4172cee3-acaa-46e9-ba39-a8e8d1b7dd03/bin/uautomizer/witness.graphml [2019-12-07 18:45:39,894 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:45:39,895 INFO L168 Benchmark]: Toolchain (without parser) took 49378.15 ms. Allocated memory was 1.0 GB in the beginning and 7.1 GB in the end (delta: 6.0 GB). Free memory was 940.8 MB in the beginning and 3.4 GB in the end (delta: -2.5 GB). Peak memory consumption was 3.6 GB. Max. memory is 11.5 GB. [2019-12-07 18:45:39,895 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:45:39,895 INFO L168 Benchmark]: CACSL2BoogieTranslator took 411.20 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -131.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:45:39,895 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.62 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 18:45:39,896 INFO L168 Benchmark]: Boogie Preprocessor took 28.83 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 18:45:39,896 INFO L168 Benchmark]: RCFGBuilder took 451.79 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.1 MB). Peak memory consumption was 61.1 MB. Max. memory is 11.5 GB. [2019-12-07 18:45:39,896 INFO L168 Benchmark]: TraceAbstraction took 48351.95 ms. Allocated memory was 1.1 GB in the beginning and 7.1 GB in the end (delta: 5.9 GB). Free memory was 1.0 GB in the beginning and 3.4 GB in the end (delta: -2.4 GB). Peak memory consumption was 3.5 GB. Max. memory is 11.5 GB. [2019-12-07 18:45:39,896 INFO L168 Benchmark]: Witness Printer took 89.78 ms. Allocated memory is still 7.1 GB. Free memory was 3.4 GB in the beginning and 3.4 GB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. [2019-12-07 18:45:39,898 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 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 411.20 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -131.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.62 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.83 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 451.79 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.1 MB). Peak memory consumption was 61.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 48351.95 ms. Allocated memory was 1.1 GB in the beginning and 7.1 GB in the end (delta: 5.9 GB). Free memory was 1.0 GB in the beginning and 3.4 GB in the end (delta: -2.4 GB). Peak memory consumption was 3.5 GB. Max. memory is 11.5 GB. * Witness Printer took 89.78 ms. Allocated memory is still 7.1 GB. Free memory was 3.4 GB in the beginning and 3.4 GB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.1s, 212 ProgramPointsBefore, 112 ProgramPointsAfterwards, 255 TransitionsBefore, 132 TransitionsAfterwards, 26510 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 48 ConcurrentYvCompositions, 28 ChoiceCompositions, 11185 VarBasedMoverChecksPositive, 319 VarBasedMoverChecksNegative, 81 SemBasedMoverChecksPositive, 338 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 141939 CheckedPairsTotal, 133 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L856] FCALL, FORK 0 pthread_create(&t133, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] FCALL, FORK 0 pthread_create(&t134, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] FCALL, FORK 0 pthread_create(&t135, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L862] FCALL, FORK 0 pthread_create(&t136, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L806] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L807] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L808] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L809] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L810] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L811] 4 z$r_buff0_thd4 = (_Bool)1 [L814] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L815] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L816] 4 z$flush_delayed = weak$$choice2 [L817] 4 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L819] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L820] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L821] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L822] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L824] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L825] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L826] 4 z = z$flush_delayed ? z$mem_tmp : z [L827] 4 z$flush_delayed = (_Bool)0 [L830] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 y = 1 [L773] 3 __unbuffered_p2_EAX = y [L776] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L777] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L778] 3 z$flush_delayed = weak$$choice2 [L779] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L781] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L833] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L782] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L783] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L784] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L785] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L786] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L787] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L833] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L834] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L835] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L864] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L868] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L869] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L870] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L871] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 200 locations, 2 error locations. Result: UNSAFE, OverallTime: 48.1s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 8.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3711 SDtfs, 5762 SDslu, 6722 SDs, 0 SdLazy, 2137 SolverSat, 222 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 121 GetRequests, 23 SyntacticMatches, 8 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=141658occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 26.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 37698 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 833 NumberOfCodeBlocks, 833 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 749 ConstructedInterpolants, 0 QuantifiedInterpolants, 300223 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...