./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe013_rmo.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_12103cdb-b14c-45d2-a310-e4548c8f4edd/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_12103cdb-b14c-45d2-a310-e4548c8f4edd/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_12103cdb-b14c-45d2-a310-e4548c8f4edd/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_12103cdb-b14c-45d2-a310-e4548c8f4edd/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe013_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_12103cdb-b14c-45d2-a310-e4548c8f4edd/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_12103cdb-b14c-45d2-a310-e4548c8f4edd/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 50cf6c1b6886c6bdbbbf396590fa6b273b5d96c9 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 15:40:54,014 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 15:40:54,015 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 15:40:54,023 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 15:40:54,023 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 15:40:54,023 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 15:40:54,024 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 15:40:54,026 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 15:40:54,027 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 15:40:54,028 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 15:40:54,028 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 15:40:54,029 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 15:40:54,029 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 15:40:54,030 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 15:40:54,030 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 15:40:54,031 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 15:40:54,032 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 15:40:54,032 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 15:40:54,034 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 15:40:54,035 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 15:40:54,036 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 15:40:54,037 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 15:40:54,038 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 15:40:54,038 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 15:40:54,040 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 15:40:54,040 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 15:40:54,040 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 15:40:54,040 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 15:40:54,041 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 15:40:54,041 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 15:40:54,041 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 15:40:54,042 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 15:40:54,042 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 15:40:54,043 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 15:40:54,043 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 15:40:54,043 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 15:40:54,044 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 15:40:54,044 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 15:40:54,044 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 15:40:54,044 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 15:40:54,045 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 15:40:54,045 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_12103cdb-b14c-45d2-a310-e4548c8f4edd/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 15:40:54,055 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 15:40:54,055 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 15:40:54,056 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 15:40:54,056 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 15:40:54,056 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 15:40:54,056 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 15:40:54,056 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 15:40:54,056 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 15:40:54,057 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 15:40:54,057 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 15:40:54,057 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 15:40:54,057 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 15:40:54,057 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 15:40:54,057 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 15:40:54,057 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 15:40:54,057 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 15:40:54,057 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 15:40:54,058 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 15:40:54,058 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 15:40:54,058 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 15:40:54,058 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 15:40:54,058 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 15:40:54,058 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 15:40:54,058 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 15:40:54,059 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 15:40:54,059 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 15:40:54,059 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 15:40:54,059 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 15:40:54,059 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 15:40:54,059 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_12103cdb-b14c-45d2-a310-e4548c8f4edd/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 -> 50cf6c1b6886c6bdbbbf396590fa6b273b5d96c9 [2019-12-07 15:40:54,160 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 15:40:54,170 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 15:40:54,173 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 15:40:54,174 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 15:40:54,174 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 15:40:54,175 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_12103cdb-b14c-45d2-a310-e4548c8f4edd/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe013_rmo.opt.i [2019-12-07 15:40:54,218 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_12103cdb-b14c-45d2-a310-e4548c8f4edd/bin/uautomizer/data/2632a80de/71e13d8dfc03423cb68e81d5b82f3582/FLAGe4637e458 [2019-12-07 15:40:54,556 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 15:40:54,557 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_12103cdb-b14c-45d2-a310-e4548c8f4edd/sv-benchmarks/c/pthread-wmm/safe013_rmo.opt.i [2019-12-07 15:40:54,567 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_12103cdb-b14c-45d2-a310-e4548c8f4edd/bin/uautomizer/data/2632a80de/71e13d8dfc03423cb68e81d5b82f3582/FLAGe4637e458 [2019-12-07 15:40:54,575 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_12103cdb-b14c-45d2-a310-e4548c8f4edd/bin/uautomizer/data/2632a80de/71e13d8dfc03423cb68e81d5b82f3582 [2019-12-07 15:40:54,577 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 15:40:54,578 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 15:40:54,578 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 15:40:54,579 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 15:40:54,581 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 15:40:54,581 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:40:54" (1/1) ... [2019-12-07 15:40:54,583 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25138a46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:40:54, skipping insertion in model container [2019-12-07 15:40:54,583 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:40:54" (1/1) ... [2019-12-07 15:40:54,588 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 15:40:54,615 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 15:40:54,896 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:40:54,907 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 15:40:54,962 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:40:55,018 INFO L208 MainTranslator]: Completed translation [2019-12-07 15:40:55,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:40:55 WrapperNode [2019-12-07 15:40:55,019 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 15:40:55,019 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 15:40:55,019 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 15:40:55,019 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 15:40:55,025 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:40:55" (1/1) ... [2019-12-07 15:40:55,038 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:40:55" (1/1) ... [2019-12-07 15:40:55,057 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 15:40:55,057 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 15:40:55,057 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 15:40:55,057 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 15:40:55,063 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:40:55" (1/1) ... [2019-12-07 15:40:55,063 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:40:55" (1/1) ... [2019-12-07 15:40:55,067 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:40:55" (1/1) ... [2019-12-07 15:40:55,067 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:40:55" (1/1) ... [2019-12-07 15:40:55,074 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:40:55" (1/1) ... [2019-12-07 15:40:55,078 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:40:55" (1/1) ... [2019-12-07 15:40:55,081 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:40:55" (1/1) ... [2019-12-07 15:40:55,085 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 15:40:55,085 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 15:40:55,085 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 15:40:55,085 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 15:40:55,086 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:40:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_12103cdb-b14c-45d2-a310-e4548c8f4edd/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 15:40:55,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 15:40:55,128 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 15:40:55,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 15:40:55,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 15:40:55,128 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 15:40:55,128 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 15:40:55,128 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 15:40:55,128 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 15:40:55,128 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 15:40:55,128 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 15:40:55,128 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 15:40:55,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 15:40:55,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 15:40:55,130 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 15:40:55,481 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 15:40:55,481 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 15:40:55,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:40:55 BoogieIcfgContainer [2019-12-07 15:40:55,482 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 15:40:55,483 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 15:40:55,483 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 15:40:55,485 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 15:40:55,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 03:40:54" (1/3) ... [2019-12-07 15:40:55,486 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29cc4f82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 03:40:55, skipping insertion in model container [2019-12-07 15:40:55,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:40:55" (2/3) ... [2019-12-07 15:40:55,486 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29cc4f82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 03:40:55, skipping insertion in model container [2019-12-07 15:40:55,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:40:55" (3/3) ... [2019-12-07 15:40:55,488 INFO L109 eAbstractionObserver]: Analyzing ICFG safe013_rmo.opt.i [2019-12-07 15:40:55,494 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 15:40:55,494 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 15:40:55,499 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 15:40:55,500 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 15:40:55,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,526 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,526 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,527 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,527 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,528 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,531 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,532 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,533 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,534 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,537 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,538 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,539 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,540 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,541 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,541 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,541 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,542 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,542 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,542 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,542 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,543 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,544 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,545 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,546 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,546 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,546 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,549 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:40:55,560 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 15:40:55,573 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 15:40:55,573 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 15:40:55,573 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 15:40:55,573 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 15:40:55,573 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 15:40:55,573 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 15:40:55,573 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 15:40:55,573 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 15:40:55,586 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 194 transitions [2019-12-07 15:40:55,587 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-07 15:40:55,645 INFO L134 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-07 15:40:55,645 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 15:40:55,654 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 721 event pairs. 9/157 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-07 15:40:55,669 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-07 15:40:55,698 INFO L134 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-07 15:40:55,698 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 15:40:55,703 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 721 event pairs. 9/157 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-07 15:40:55,716 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-07 15:40:55,717 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 15:40:58,760 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-07 15:40:58,908 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66094 [2019-12-07 15:40:58,908 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-07 15:40:58,910 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 92 transitions [2019-12-07 15:41:08,397 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 86132 states. [2019-12-07 15:41:08,399 INFO L276 IsEmpty]: Start isEmpty. Operand 86132 states. [2019-12-07 15:41:08,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 15:41:08,402 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:41:08,403 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 15:41:08,403 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:41:08,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:41:08,407 INFO L82 PathProgramCache]: Analyzing trace with hash 794637732, now seen corresponding path program 1 times [2019-12-07 15:41:08,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:41:08,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981557365] [2019-12-07 15:41:08,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:41:08,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:41:08,555 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 15:41:08,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981557365] [2019-12-07 15:41:08,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:41:08,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 15:41:08,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637256826] [2019-12-07 15:41:08,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:41:08,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:41:08,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:41:08,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:41:08,570 INFO L87 Difference]: Start difference. First operand 86132 states. Second operand 3 states. [2019-12-07 15:41:09,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:41:09,107 INFO L93 Difference]: Finished difference Result 85012 states and 367904 transitions. [2019-12-07 15:41:09,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:41:09,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 15:41:09,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:41:09,651 INFO L225 Difference]: With dead ends: 85012 [2019-12-07 15:41:09,651 INFO L226 Difference]: Without dead ends: 80140 [2019-12-07 15:41:09,652 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 15:41:12,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80140 states. [2019-12-07 15:41:13,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80140 to 80140. [2019-12-07 15:41:13,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80140 states. [2019-12-07 15:41:13,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80140 states to 80140 states and 346330 transitions. [2019-12-07 15:41:13,736 INFO L78 Accepts]: Start accepts. Automaton has 80140 states and 346330 transitions. Word has length 5 [2019-12-07 15:41:13,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:41:13,737 INFO L462 AbstractCegarLoop]: Abstraction has 80140 states and 346330 transitions. [2019-12-07 15:41:13,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:41:13,737 INFO L276 IsEmpty]: Start isEmpty. Operand 80140 states and 346330 transitions. [2019-12-07 15:41:13,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 15:41:13,746 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:41:13,746 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:41:13,747 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:41:13,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:41:13,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1795694344, now seen corresponding path program 1 times [2019-12-07 15:41:13,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:41:13,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406851599] [2019-12-07 15:41:13,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:41:13,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:41:13,831 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 15:41:13,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406851599] [2019-12-07 15:41:13,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:41:13,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:41:13,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537073986] [2019-12-07 15:41:13,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:41:13,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:41:13,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:41:13,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:41:13,833 INFO L87 Difference]: Start difference. First operand 80140 states and 346330 transitions. Second operand 4 states. [2019-12-07 15:41:15,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:41:15,955 INFO L93 Difference]: Finished difference Result 123388 states and 510822 transitions. [2019-12-07 15:41:15,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 15:41:15,956 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 15:41:15,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:41:16,305 INFO L225 Difference]: With dead ends: 123388 [2019-12-07 15:41:16,305 INFO L226 Difference]: Without dead ends: 123290 [2019-12-07 15:41:16,306 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 15:41:19,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123290 states. [2019-12-07 15:41:21,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123290 to 114218. [2019-12-07 15:41:21,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114218 states. [2019-12-07 15:41:21,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114218 states to 114218 states and 477794 transitions. [2019-12-07 15:41:21,617 INFO L78 Accepts]: Start accepts. Automaton has 114218 states and 477794 transitions. Word has length 13 [2019-12-07 15:41:21,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:41:21,617 INFO L462 AbstractCegarLoop]: Abstraction has 114218 states and 477794 transitions. [2019-12-07 15:41:21,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:41:21,618 INFO L276 IsEmpty]: Start isEmpty. Operand 114218 states and 477794 transitions. [2019-12-07 15:41:21,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 15:41:21,620 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:41:21,620 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:41:21,621 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:41:21,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:41:21,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1307118492, now seen corresponding path program 1 times [2019-12-07 15:41:21,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:41:21,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128237851] [2019-12-07 15:41:21,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:41:21,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:41:21,681 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 15:41:21,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128237851] [2019-12-07 15:41:21,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:41:21,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:41:21,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115586751] [2019-12-07 15:41:21,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:41:21,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:41:21,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:41:21,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:41:21,682 INFO L87 Difference]: Start difference. First operand 114218 states and 477794 transitions. Second operand 4 states. [2019-12-07 15:41:22,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:41:22,871 INFO L93 Difference]: Finished difference Result 159677 states and 652290 transitions. [2019-12-07 15:41:22,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 15:41:22,872 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 15:41:22,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:41:23,266 INFO L225 Difference]: With dead ends: 159677 [2019-12-07 15:41:23,267 INFO L226 Difference]: Without dead ends: 159565 [2019-12-07 15:41:23,267 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:41:28,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159565 states. [2019-12-07 15:41:30,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159565 to 136035. [2019-12-07 15:41:30,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136035 states. [2019-12-07 15:41:31,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136035 states to 136035 states and 564894 transitions. [2019-12-07 15:41:31,136 INFO L78 Accepts]: Start accepts. Automaton has 136035 states and 564894 transitions. Word has length 13 [2019-12-07 15:41:31,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:41:31,137 INFO L462 AbstractCegarLoop]: Abstraction has 136035 states and 564894 transitions. [2019-12-07 15:41:31,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:41:31,137 INFO L276 IsEmpty]: Start isEmpty. Operand 136035 states and 564894 transitions. [2019-12-07 15:41:31,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 15:41:31,139 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:41:31,140 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:41:31,140 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:41:31,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:41:31,140 INFO L82 PathProgramCache]: Analyzing trace with hash 2137171342, now seen corresponding path program 1 times [2019-12-07 15:41:31,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:41:31,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145734173] [2019-12-07 15:41:31,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:41:31,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:41:31,167 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 15:41:31,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145734173] [2019-12-07 15:41:31,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:41:31,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:41:31,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899797809] [2019-12-07 15:41:31,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:41:31,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:41:31,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:41:31,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:41:31,168 INFO L87 Difference]: Start difference. First operand 136035 states and 564894 transitions. Second operand 3 states. [2019-12-07 15:41:31,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:41:31,954 INFO L93 Difference]: Finished difference Result 181618 states and 742473 transitions. [2019-12-07 15:41:31,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:41:31,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-07 15:41:31,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:41:32,421 INFO L225 Difference]: With dead ends: 181618 [2019-12-07 15:41:32,421 INFO L226 Difference]: Without dead ends: 181618 [2019-12-07 15:41:32,421 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:41:36,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181618 states. [2019-12-07 15:41:40,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181618 to 152081. [2019-12-07 15:41:40,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152081 states. [2019-12-07 15:41:41,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152081 states to 152081 states and 628919 transitions. [2019-12-07 15:41:41,331 INFO L78 Accepts]: Start accepts. Automaton has 152081 states and 628919 transitions. Word has length 14 [2019-12-07 15:41:41,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:41:41,331 INFO L462 AbstractCegarLoop]: Abstraction has 152081 states and 628919 transitions. [2019-12-07 15:41:41,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:41:41,331 INFO L276 IsEmpty]: Start isEmpty. Operand 152081 states and 628919 transitions. [2019-12-07 15:41:41,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 15:41:41,334 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:41:41,334 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:41:41,334 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:41:41,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:41:41,335 INFO L82 PathProgramCache]: Analyzing trace with hash 2137037670, now seen corresponding path program 1 times [2019-12-07 15:41:41,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:41:41,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413726249] [2019-12-07 15:41:41,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:41:41,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:41:41,384 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 15:41:41,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413726249] [2019-12-07 15:41:41,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:41:41,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:41:41,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415219642] [2019-12-07 15:41:41,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:41:41,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:41:41,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:41:41,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:41:41,386 INFO L87 Difference]: Start difference. First operand 152081 states and 628919 transitions. Second operand 4 states. [2019-12-07 15:41:42,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:41:42,312 INFO L93 Difference]: Finished difference Result 179622 states and 732719 transitions. [2019-12-07 15:41:42,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 15:41:42,313 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 15:41:42,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:41:43,213 INFO L225 Difference]: With dead ends: 179622 [2019-12-07 15:41:43,214 INFO L226 Difference]: Without dead ends: 179542 [2019-12-07 15:41:43,214 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 15:41:47,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179542 states. [2019-12-07 15:41:49,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179542 to 157787. [2019-12-07 15:41:49,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157787 states. [2019-12-07 15:41:50,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157787 states to 157787 states and 651479 transitions. [2019-12-07 15:41:50,202 INFO L78 Accepts]: Start accepts. Automaton has 157787 states and 651479 transitions. Word has length 14 [2019-12-07 15:41:50,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:41:50,202 INFO L462 AbstractCegarLoop]: Abstraction has 157787 states and 651479 transitions. [2019-12-07 15:41:50,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:41:50,202 INFO L276 IsEmpty]: Start isEmpty. Operand 157787 states and 651479 transitions. [2019-12-07 15:41:50,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 15:41:50,204 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:41:50,205 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:41:50,205 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:41:50,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:41:50,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1997758702, now seen corresponding path program 1 times [2019-12-07 15:41:50,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:41:50,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927896674] [2019-12-07 15:41:50,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:41:50,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:41:50,248 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 15:41:50,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927896674] [2019-12-07 15:41:50,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:41:50,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:41:50,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251428583] [2019-12-07 15:41:50,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:41:50,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:41:50,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:41:50,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:41:50,249 INFO L87 Difference]: Start difference. First operand 157787 states and 651479 transitions. Second operand 4 states. [2019-12-07 15:41:51,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:41:51,174 INFO L93 Difference]: Finished difference Result 189091 states and 772001 transitions. [2019-12-07 15:41:51,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 15:41:51,174 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 15:41:51,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:41:52,146 INFO L225 Difference]: With dead ends: 189091 [2019-12-07 15:41:52,146 INFO L226 Difference]: Without dead ends: 188995 [2019-12-07 15:41:52,146 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 15:41:56,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188995 states. [2019-12-07 15:42:00,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188995 to 161868. [2019-12-07 15:42:00,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161868 states. [2019-12-07 15:42:01,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161868 states to 161868 states and 668265 transitions. [2019-12-07 15:42:01,210 INFO L78 Accepts]: Start accepts. Automaton has 161868 states and 668265 transitions. Word has length 14 [2019-12-07 15:42:01,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:42:01,210 INFO L462 AbstractCegarLoop]: Abstraction has 161868 states and 668265 transitions. [2019-12-07 15:42:01,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:42:01,211 INFO L276 IsEmpty]: Start isEmpty. Operand 161868 states and 668265 transitions. [2019-12-07 15:42:01,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 15:42:01,223 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:42:01,224 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 15:42:01,224 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:42:01,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:42:01,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1754746770, now seen corresponding path program 1 times [2019-12-07 15:42:01,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:42:01,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900951421] [2019-12-07 15:42:01,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:42:01,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:42:01,268 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 15:42:01,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900951421] [2019-12-07 15:42:01,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:42:01,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:42:01,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588929648] [2019-12-07 15:42:01,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:42:01,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:42:01,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:42:01,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:42:01,270 INFO L87 Difference]: Start difference. First operand 161868 states and 668265 transitions. Second operand 3 states. [2019-12-07 15:42:01,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:42:01,945 INFO L93 Difference]: Finished difference Result 152758 states and 623342 transitions. [2019-12-07 15:42:01,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:42:01,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 15:42:01,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:42:02,328 INFO L225 Difference]: With dead ends: 152758 [2019-12-07 15:42:02,328 INFO L226 Difference]: Without dead ends: 152758 [2019-12-07 15:42:02,329 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 15:42:06,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152758 states. [2019-12-07 15:42:08,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152758 to 148778. [2019-12-07 15:42:08,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148778 states. [2019-12-07 15:42:08,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148778 states to 148778 states and 608180 transitions. [2019-12-07 15:42:08,760 INFO L78 Accepts]: Start accepts. Automaton has 148778 states and 608180 transitions. Word has length 18 [2019-12-07 15:42:08,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:42:08,761 INFO L462 AbstractCegarLoop]: Abstraction has 148778 states and 608180 transitions. [2019-12-07 15:42:08,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:42:08,761 INFO L276 IsEmpty]: Start isEmpty. Operand 148778 states and 608180 transitions. [2019-12-07 15:42:08,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 15:42:08,771 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:42:08,771 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 15:42:08,771 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:42:08,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:42:08,771 INFO L82 PathProgramCache]: Analyzing trace with hash 250695921, now seen corresponding path program 1 times [2019-12-07 15:42:08,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:42:08,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976963682] [2019-12-07 15:42:08,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:42:08,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:42:08,818 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 15:42:08,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976963682] [2019-12-07 15:42:08,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:42:08,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 15:42:08,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977194726] [2019-12-07 15:42:08,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:42:08,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:42:08,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:42:08,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:42:08,820 INFO L87 Difference]: Start difference. First operand 148778 states and 608180 transitions. Second operand 3 states. [2019-12-07 15:42:10,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:42:10,454 INFO L93 Difference]: Finished difference Result 277378 states and 1128575 transitions. [2019-12-07 15:42:10,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:42:10,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 15:42:10,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:42:11,130 INFO L225 Difference]: With dead ends: 277378 [2019-12-07 15:42:11,130 INFO L226 Difference]: Without dead ends: 268154 [2019-12-07 15:42:11,130 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 15:42:18,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268154 states. [2019-12-07 15:42:22,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268154 to 258617. [2019-12-07 15:42:22,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258617 states. [2019-12-07 15:42:23,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258617 states to 258617 states and 1060508 transitions. [2019-12-07 15:42:23,149 INFO L78 Accepts]: Start accepts. Automaton has 258617 states and 1060508 transitions. Word has length 18 [2019-12-07 15:42:23,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:42:23,149 INFO L462 AbstractCegarLoop]: Abstraction has 258617 states and 1060508 transitions. [2019-12-07 15:42:23,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:42:23,149 INFO L276 IsEmpty]: Start isEmpty. Operand 258617 states and 1060508 transitions. [2019-12-07 15:42:23,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 15:42:23,167 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:42:23,167 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:42:23,167 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:42:23,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:42:23,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1369748393, now seen corresponding path program 1 times [2019-12-07 15:42:23,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:42:23,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681842219] [2019-12-07 15:42:23,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:42:23,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:42:23,213 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 15:42:23,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681842219] [2019-12-07 15:42:23,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:42:23,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:42:23,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023157019] [2019-12-07 15:42:23,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:42:23,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:42:23,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:42:23,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:42:23,214 INFO L87 Difference]: Start difference. First operand 258617 states and 1060508 transitions. Second operand 4 states. [2019-12-07 15:42:23,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:42:23,463 INFO L93 Difference]: Finished difference Result 68817 states and 238292 transitions. [2019-12-07 15:42:23,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:42:23,463 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 15:42:23,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:42:23,555 INFO L225 Difference]: With dead ends: 68817 [2019-12-07 15:42:23,556 INFO L226 Difference]: Without dead ends: 52553 [2019-12-07 15:42:23,556 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 15:42:23,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52553 states. [2019-12-07 15:42:24,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52553 to 52101. [2019-12-07 15:42:24,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52101 states. [2019-12-07 15:42:24,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52101 states to 52101 states and 171085 transitions. [2019-12-07 15:42:24,822 INFO L78 Accepts]: Start accepts. Automaton has 52101 states and 171085 transitions. Word has length 19 [2019-12-07 15:42:24,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:42:24,823 INFO L462 AbstractCegarLoop]: Abstraction has 52101 states and 171085 transitions. [2019-12-07 15:42:24,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:42:24,823 INFO L276 IsEmpty]: Start isEmpty. Operand 52101 states and 171085 transitions. [2019-12-07 15:42:24,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 15:42:24,832 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:42:24,832 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 15:42:24,833 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:42:24,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:42:24,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1918737222, now seen corresponding path program 1 times [2019-12-07 15:42:24,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:42:24,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670142482] [2019-12-07 15:42:24,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:42:24,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:42:24,879 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 15:42:24,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670142482] [2019-12-07 15:42:24,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:42:24,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:42:24,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537345067] [2019-12-07 15:42:24,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:42:24,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:42:24,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:42:24,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:42:24,880 INFO L87 Difference]: Start difference. First operand 52101 states and 171085 transitions. Second operand 5 states. [2019-12-07 15:42:25,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:42:25,338 INFO L93 Difference]: Finished difference Result 69867 states and 224948 transitions. [2019-12-07 15:42:25,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 15:42:25,339 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 15:42:25,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:42:25,444 INFO L225 Difference]: With dead ends: 69867 [2019-12-07 15:42:25,445 INFO L226 Difference]: Without dead ends: 69607 [2019-12-07 15:42:25,445 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 15:42:25,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69607 states. [2019-12-07 15:42:26,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69607 to 52323. [2019-12-07 15:42:26,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52323 states. [2019-12-07 15:42:26,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52323 states to 52323 states and 171628 transitions. [2019-12-07 15:42:26,446 INFO L78 Accepts]: Start accepts. Automaton has 52323 states and 171628 transitions. Word has length 22 [2019-12-07 15:42:26,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:42:26,446 INFO L462 AbstractCegarLoop]: Abstraction has 52323 states and 171628 transitions. [2019-12-07 15:42:26,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:42:26,446 INFO L276 IsEmpty]: Start isEmpty. Operand 52323 states and 171628 transitions. [2019-12-07 15:42:26,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 15:42:26,456 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:42:26,456 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 15:42:26,456 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:42:26,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:42:26,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1233781658, now seen corresponding path program 1 times [2019-12-07 15:42:26,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:42:26,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764780928] [2019-12-07 15:42:26,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:42:26,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:42:26,513 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 15:42:26,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764780928] [2019-12-07 15:42:26,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:42:26,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:42:26,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673835336] [2019-12-07 15:42:26,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:42:26,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:42:26,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:42:26,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:42:26,514 INFO L87 Difference]: Start difference. First operand 52323 states and 171628 transitions. Second operand 5 states. [2019-12-07 15:42:27,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:42:27,430 INFO L93 Difference]: Finished difference Result 70464 states and 226527 transitions. [2019-12-07 15:42:27,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 15:42:27,431 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 15:42:27,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:42:27,530 INFO L225 Difference]: With dead ends: 70464 [2019-12-07 15:42:27,531 INFO L226 Difference]: Without dead ends: 70098 [2019-12-07 15:42:27,531 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 15:42:27,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70098 states. [2019-12-07 15:42:28,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70098 to 50864. [2019-12-07 15:42:28,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50864 states. [2019-12-07 15:42:28,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50864 states to 50864 states and 166565 transitions. [2019-12-07 15:42:28,485 INFO L78 Accepts]: Start accepts. Automaton has 50864 states and 166565 transitions. Word has length 22 [2019-12-07 15:42:28,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:42:28,485 INFO L462 AbstractCegarLoop]: Abstraction has 50864 states and 166565 transitions. [2019-12-07 15:42:28,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:42:28,485 INFO L276 IsEmpty]: Start isEmpty. Operand 50864 states and 166565 transitions. [2019-12-07 15:42:28,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 15:42:28,502 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:42:28,502 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:42:28,502 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:42:28,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:42:28,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1628067424, now seen corresponding path program 1 times [2019-12-07 15:42:28,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:42:28,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376671640] [2019-12-07 15:42:28,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:42:28,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:42:28,547 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 15:42:28,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376671640] [2019-12-07 15:42:28,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:42:28,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:42:28,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783490738] [2019-12-07 15:42:28,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:42:28,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:42:28,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:42:28,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:42:28,548 INFO L87 Difference]: Start difference. First operand 50864 states and 166565 transitions. Second operand 5 states. [2019-12-07 15:42:28,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:42:28,631 INFO L93 Difference]: Finished difference Result 22680 states and 71182 transitions. [2019-12-07 15:42:28,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 15:42:28,632 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 15:42:28,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:42:28,654 INFO L225 Difference]: With dead ends: 22680 [2019-12-07 15:42:28,655 INFO L226 Difference]: Without dead ends: 19722 [2019-12-07 15:42:28,655 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 15:42:28,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19722 states. [2019-12-07 15:42:28,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19722 to 19722. [2019-12-07 15:42:28,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19722 states. [2019-12-07 15:42:28,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19722 states to 19722 states and 61602 transitions. [2019-12-07 15:42:28,915 INFO L78 Accepts]: Start accepts. Automaton has 19722 states and 61602 transitions. Word has length 25 [2019-12-07 15:42:28,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:42:28,915 INFO L462 AbstractCegarLoop]: Abstraction has 19722 states and 61602 transitions. [2019-12-07 15:42:28,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:42:28,915 INFO L276 IsEmpty]: Start isEmpty. Operand 19722 states and 61602 transitions. [2019-12-07 15:42:28,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 15:42:28,940 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:42:28,941 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] [2019-12-07 15:42:28,941 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:42:28,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:42:28,941 INFO L82 PathProgramCache]: Analyzing trace with hash 483024013, now seen corresponding path program 1 times [2019-12-07 15:42:28,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:42:28,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432613919] [2019-12-07 15:42:28,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:42:28,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:42:29,093 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 15:42:29,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432613919] [2019-12-07 15:42:29,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:42:29,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 15:42:29,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343120672] [2019-12-07 15:42:29,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 15:42:29,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:42:29,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 15:42:29,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 15:42:29,094 INFO L87 Difference]: Start difference. First operand 19722 states and 61602 transitions. Second operand 8 states. [2019-12-07 15:42:29,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:42:29,682 INFO L93 Difference]: Finished difference Result 27482 states and 82966 transitions. [2019-12-07 15:42:29,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 15:42:29,683 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2019-12-07 15:42:29,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:42:29,716 INFO L225 Difference]: With dead ends: 27482 [2019-12-07 15:42:29,717 INFO L226 Difference]: Without dead ends: 27410 [2019-12-07 15:42:29,717 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-12-07 15:42:29,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27410 states. [2019-12-07 15:42:30,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27410 to 22123. [2019-12-07 15:42:30,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22123 states. [2019-12-07 15:42:30,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22123 states to 22123 states and 68313 transitions. [2019-12-07 15:42:30,333 INFO L78 Accepts]: Start accepts. Automaton has 22123 states and 68313 transitions. Word has length 40 [2019-12-07 15:42:30,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:42:30,333 INFO L462 AbstractCegarLoop]: Abstraction has 22123 states and 68313 transitions. [2019-12-07 15:42:30,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 15:42:30,333 INFO L276 IsEmpty]: Start isEmpty. Operand 22123 states and 68313 transitions. [2019-12-07 15:42:30,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 15:42:30,355 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:42:30,355 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] [2019-12-07 15:42:30,355 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:42:30,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:42:30,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1287456143, now seen corresponding path program 2 times [2019-12-07 15:42:30,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:42:30,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704717026] [2019-12-07 15:42:30,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:42:30,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:42:30,404 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 15:42:30,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704717026] [2019-12-07 15:42:30,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:42:30,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:42:30,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078504100] [2019-12-07 15:42:30,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:42:30,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:42:30,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:42:30,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:42:30,405 INFO L87 Difference]: Start difference. First operand 22123 states and 68313 transitions. Second operand 5 states. [2019-12-07 15:42:30,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:42:30,610 INFO L93 Difference]: Finished difference Result 25367 states and 77084 transitions. [2019-12-07 15:42:30,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 15:42:30,610 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-07 15:42:30,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:42:30,642 INFO L225 Difference]: With dead ends: 25367 [2019-12-07 15:42:30,642 INFO L226 Difference]: Without dead ends: 25365 [2019-12-07 15:42:30,643 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 15:42:30,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25365 states. [2019-12-07 15:42:30,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25365 to 22177. [2019-12-07 15:42:30,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22177 states. [2019-12-07 15:42:30,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22177 states to 22177 states and 68479 transitions. [2019-12-07 15:42:30,974 INFO L78 Accepts]: Start accepts. Automaton has 22177 states and 68479 transitions. Word has length 40 [2019-12-07 15:42:30,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:42:30,974 INFO L462 AbstractCegarLoop]: Abstraction has 22177 states and 68479 transitions. [2019-12-07 15:42:30,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:42:30,974 INFO L276 IsEmpty]: Start isEmpty. Operand 22177 states and 68479 transitions. [2019-12-07 15:42:30,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 15:42:30,993 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:42:30,993 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] [2019-12-07 15:42:30,994 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:42:30,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:42:30,994 INFO L82 PathProgramCache]: Analyzing trace with hash -2043115507, now seen corresponding path program 3 times [2019-12-07 15:42:30,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:42:30,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170733522] [2019-12-07 15:42:30,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:42:31,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:42:31,044 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 15:42:31,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170733522] [2019-12-07 15:42:31,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:42:31,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 15:42:31,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044992539] [2019-12-07 15:42:31,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 15:42:31,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:42:31,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 15:42:31,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 15:42:31,046 INFO L87 Difference]: Start difference. First operand 22177 states and 68479 transitions. Second operand 6 states. [2019-12-07 15:42:31,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:42:31,141 INFO L93 Difference]: Finished difference Result 20308 states and 64057 transitions. [2019-12-07 15:42:31,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 15:42:31,141 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-07 15:42:31,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:42:31,164 INFO L225 Difference]: With dead ends: 20308 [2019-12-07 15:42:31,165 INFO L226 Difference]: Without dead ends: 19790 [2019-12-07 15:42:31,165 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 15:42:31,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19790 states. [2019-12-07 15:42:31,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19790 to 10184. [2019-12-07 15:42:31,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10184 states. [2019-12-07 15:42:31,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10184 states to 10184 states and 32351 transitions. [2019-12-07 15:42:31,371 INFO L78 Accepts]: Start accepts. Automaton has 10184 states and 32351 transitions. Word has length 40 [2019-12-07 15:42:31,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:42:31,372 INFO L462 AbstractCegarLoop]: Abstraction has 10184 states and 32351 transitions. [2019-12-07 15:42:31,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 15:42:31,372 INFO L276 IsEmpty]: Start isEmpty. Operand 10184 states and 32351 transitions. [2019-12-07 15:42:31,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 15:42:31,382 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:42:31,382 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] [2019-12-07 15:42:31,382 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:42:31,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:42:31,383 INFO L82 PathProgramCache]: Analyzing trace with hash 2087853405, now seen corresponding path program 1 times [2019-12-07 15:42:31,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:42:31,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249341012] [2019-12-07 15:42:31,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:42:31,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:42:31,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:42:31,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249341012] [2019-12-07 15:42:31,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:42:31,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 15:42:31,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024031826] [2019-12-07 15:42:31,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:42:31,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:42:31,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:42:31,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:42:31,430 INFO L87 Difference]: Start difference. First operand 10184 states and 32351 transitions. Second operand 5 states. [2019-12-07 15:42:31,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:42:31,718 INFO L93 Difference]: Finished difference Result 15977 states and 49790 transitions. [2019-12-07 15:42:31,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 15:42:31,718 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-12-07 15:42:31,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:42:31,736 INFO L225 Difference]: With dead ends: 15977 [2019-12-07 15:42:31,736 INFO L226 Difference]: Without dead ends: 15977 [2019-12-07 15:42:31,736 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 15:42:31,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15977 states. [2019-12-07 15:42:31,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15977 to 13354. [2019-12-07 15:42:31,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13354 states. [2019-12-07 15:42:31,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13354 states to 13354 states and 42284 transitions. [2019-12-07 15:42:31,947 INFO L78 Accepts]: Start accepts. Automaton has 13354 states and 42284 transitions. Word has length 55 [2019-12-07 15:42:31,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:42:31,947 INFO L462 AbstractCegarLoop]: Abstraction has 13354 states and 42284 transitions. [2019-12-07 15:42:31,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:42:31,947 INFO L276 IsEmpty]: Start isEmpty. Operand 13354 states and 42284 transitions. [2019-12-07 15:42:31,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 15:42:31,960 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:42:31,961 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] [2019-12-07 15:42:31,961 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:42:31,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:42:31,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1066766813, now seen corresponding path program 2 times [2019-12-07 15:42:31,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:42:31,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40834743] [2019-12-07 15:42:31,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:42:31,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:42:32,013 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 15:42:32,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40834743] [2019-12-07 15:42:32,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:42:32,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:42:32,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850747440] [2019-12-07 15:42:32,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:42:32,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:42:32,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:42:32,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:42:32,014 INFO L87 Difference]: Start difference. First operand 13354 states and 42284 transitions. Second operand 3 states. [2019-12-07 15:42:32,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:42:32,055 INFO L93 Difference]: Finished difference Result 12683 states and 39588 transitions. [2019-12-07 15:42:32,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:42:32,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-07 15:42:32,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:42:32,073 INFO L225 Difference]: With dead ends: 12683 [2019-12-07 15:42:32,073 INFO L226 Difference]: Without dead ends: 12683 [2019-12-07 15:42:32,074 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 15:42:32,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12683 states. [2019-12-07 15:42:32,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12683 to 12079. [2019-12-07 15:42:32,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12079 states. [2019-12-07 15:42:32,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12079 states to 12079 states and 37901 transitions. [2019-12-07 15:42:32,240 INFO L78 Accepts]: Start accepts. Automaton has 12079 states and 37901 transitions. Word has length 55 [2019-12-07 15:42:32,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:42:32,240 INFO L462 AbstractCegarLoop]: Abstraction has 12079 states and 37901 transitions. [2019-12-07 15:42:32,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:42:32,241 INFO L276 IsEmpty]: Start isEmpty. Operand 12079 states and 37901 transitions. [2019-12-07 15:42:32,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 15:42:32,251 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:42:32,252 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] [2019-12-07 15:42:32,252 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:42:32,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:42:32,252 INFO L82 PathProgramCache]: Analyzing trace with hash -944534763, now seen corresponding path program 1 times [2019-12-07 15:42:32,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:42:32,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959976158] [2019-12-07 15:42:32,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:42:32,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:42:32,311 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 15:42:32,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959976158] [2019-12-07 15:42:32,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:42:32,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:42:32,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693498899] [2019-12-07 15:42:32,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:42:32,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:42:32,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:42:32,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:42:32,313 INFO L87 Difference]: Start difference. First operand 12079 states and 37901 transitions. Second operand 4 states. [2019-12-07 15:42:32,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:42:32,387 INFO L93 Difference]: Finished difference Result 21799 states and 68422 transitions. [2019-12-07 15:42:32,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:42:32,388 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-12-07 15:42:32,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:42:32,399 INFO L225 Difference]: With dead ends: 21799 [2019-12-07 15:42:32,399 INFO L226 Difference]: Without dead ends: 10168 [2019-12-07 15:42:32,399 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 15:42:32,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10168 states. [2019-12-07 15:42:32,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10168 to 10168. [2019-12-07 15:42:32,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10168 states. [2019-12-07 15:42:32,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10168 states to 10168 states and 31730 transitions. [2019-12-07 15:42:32,539 INFO L78 Accepts]: Start accepts. Automaton has 10168 states and 31730 transitions. Word has length 56 [2019-12-07 15:42:32,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:42:32,539 INFO L462 AbstractCegarLoop]: Abstraction has 10168 states and 31730 transitions. [2019-12-07 15:42:32,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:42:32,539 INFO L276 IsEmpty]: Start isEmpty. Operand 10168 states and 31730 transitions. [2019-12-07 15:42:32,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 15:42:32,547 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:42:32,548 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] [2019-12-07 15:42:32,548 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:42:32,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:42:32,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1033271685, now seen corresponding path program 2 times [2019-12-07 15:42:32,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:42:32,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511661041] [2019-12-07 15:42:32,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:42:32,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:42:33,050 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 15:42:33,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511661041] [2019-12-07 15:42:33,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:42:33,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 15:42:33,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567209096] [2019-12-07 15:42:33,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 15:42:33,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:42:33,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 15:42:33,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-07 15:42:33,051 INFO L87 Difference]: Start difference. First operand 10168 states and 31730 transitions. Second operand 15 states. [2019-12-07 15:42:40,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:42:40,793 INFO L93 Difference]: Finished difference Result 33669 states and 104181 transitions. [2019-12-07 15:42:40,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-12-07 15:42:40,793 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2019-12-07 15:42:40,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:42:40,816 INFO L225 Difference]: With dead ends: 33669 [2019-12-07 15:42:40,816 INFO L226 Difference]: Without dead ends: 20979 [2019-12-07 15:42:40,818 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2112 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=940, Invalid=5380, Unknown=0, NotChecked=0, Total=6320 [2019-12-07 15:42:40,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20979 states. [2019-12-07 15:42:41,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20979 to 12207. [2019-12-07 15:42:41,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12207 states. [2019-12-07 15:42:41,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12207 states to 12207 states and 38003 transitions. [2019-12-07 15:42:41,053 INFO L78 Accepts]: Start accepts. Automaton has 12207 states and 38003 transitions. Word has length 56 [2019-12-07 15:42:41,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:42:41,053 INFO L462 AbstractCegarLoop]: Abstraction has 12207 states and 38003 transitions. [2019-12-07 15:42:41,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 15:42:41,053 INFO L276 IsEmpty]: Start isEmpty. Operand 12207 states and 38003 transitions. [2019-12-07 15:42:41,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 15:42:41,065 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:42:41,065 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] [2019-12-07 15:42:41,065 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:42:41,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:42:41,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1049666311, now seen corresponding path program 3 times [2019-12-07 15:42:41,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:42:41,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151303264] [2019-12-07 15:42:41,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:42:41,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:42:41,271 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 15:42:41,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151303264] [2019-12-07 15:42:41,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:42:41,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 15:42:41,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780116784] [2019-12-07 15:42:41,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 15:42:41,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:42:41,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 15:42:41,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-07 15:42:41,273 INFO L87 Difference]: Start difference. First operand 12207 states and 38003 transitions. Second operand 13 states. [2019-12-07 15:42:43,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:42:43,525 INFO L93 Difference]: Finished difference Result 26315 states and 80597 transitions. [2019-12-07 15:42:43,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-07 15:42:43,527 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 56 [2019-12-07 15:42:43,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:42:43,558 INFO L225 Difference]: With dead ends: 26315 [2019-12-07 15:42:43,558 INFO L226 Difference]: Without dead ends: 17456 [2019-12-07 15:42:43,559 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=231, Invalid=1029, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 15:42:43,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17456 states. [2019-12-07 15:42:43,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17456 to 13108. [2019-12-07 15:42:43,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13108 states. [2019-12-07 15:42:43,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13108 states to 13108 states and 40439 transitions. [2019-12-07 15:42:43,771 INFO L78 Accepts]: Start accepts. Automaton has 13108 states and 40439 transitions. Word has length 56 [2019-12-07 15:42:43,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:42:43,771 INFO L462 AbstractCegarLoop]: Abstraction has 13108 states and 40439 transitions. [2019-12-07 15:42:43,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 15:42:43,771 INFO L276 IsEmpty]: Start isEmpty. Operand 13108 states and 40439 transitions. [2019-12-07 15:42:43,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 15:42:43,784 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:42:43,785 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] [2019-12-07 15:42:43,785 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:42:43,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:42:43,785 INFO L82 PathProgramCache]: Analyzing trace with hash 65039161, now seen corresponding path program 4 times [2019-12-07 15:42:43,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:42:43,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53459610] [2019-12-07 15:42:43,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:42:43,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:42:43,952 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 15:42:43,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53459610] [2019-12-07 15:42:43,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:42:43,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 15:42:43,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58394447] [2019-12-07 15:42:43,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 15:42:43,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:42:43,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 15:42:43,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-07 15:42:43,953 INFO L87 Difference]: Start difference. First operand 13108 states and 40439 transitions. Second operand 12 states. [2019-12-07 15:42:47,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:42:47,107 INFO L93 Difference]: Finished difference Result 20463 states and 62116 transitions. [2019-12-07 15:42:47,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 15:42:47,107 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-12-07 15:42:47,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:42:47,125 INFO L225 Difference]: With dead ends: 20463 [2019-12-07 15:42:47,125 INFO L226 Difference]: Without dead ends: 16994 [2019-12-07 15:42:47,126 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=133, Invalid=517, Unknown=0, NotChecked=0, Total=650 [2019-12-07 15:42:47,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16994 states. [2019-12-07 15:42:47,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16994 to 13362. [2019-12-07 15:42:47,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13362 states. [2019-12-07 15:42:47,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13362 states to 13362 states and 40999 transitions. [2019-12-07 15:42:47,338 INFO L78 Accepts]: Start accepts. Automaton has 13362 states and 40999 transitions. Word has length 56 [2019-12-07 15:42:47,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:42:47,339 INFO L462 AbstractCegarLoop]: Abstraction has 13362 states and 40999 transitions. [2019-12-07 15:42:47,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 15:42:47,339 INFO L276 IsEmpty]: Start isEmpty. Operand 13362 states and 40999 transitions. [2019-12-07 15:42:47,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 15:42:47,351 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:42:47,352 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] [2019-12-07 15:42:47,352 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:42:47,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:42:47,352 INFO L82 PathProgramCache]: Analyzing trace with hash 496878283, now seen corresponding path program 5 times [2019-12-07 15:42:47,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:42:47,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563882684] [2019-12-07 15:42:47,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:42:47,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:42:47,559 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 15:42:47,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563882684] [2019-12-07 15:42:47,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:42:47,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 15:42:47,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953325916] [2019-12-07 15:42:47,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 15:42:47,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:42:47,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 15:42:47,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 15:42:47,561 INFO L87 Difference]: Start difference. First operand 13362 states and 40999 transitions. Second operand 11 states. [2019-12-07 15:42:48,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:42:48,276 INFO L93 Difference]: Finished difference Result 28004 states and 85919 transitions. [2019-12-07 15:42:48,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-07 15:42:48,277 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-07 15:42:48,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:42:48,299 INFO L225 Difference]: With dead ends: 28004 [2019-12-07 15:42:48,299 INFO L226 Difference]: Without dead ends: 19904 [2019-12-07 15:42:48,300 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=248, Invalid=1012, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 15:42:48,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19904 states. [2019-12-07 15:42:48,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19904 to 12333. [2019-12-07 15:42:48,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12333 states. [2019-12-07 15:42:48,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12333 states to 12333 states and 37967 transitions. [2019-12-07 15:42:48,535 INFO L78 Accepts]: Start accepts. Automaton has 12333 states and 37967 transitions. Word has length 56 [2019-12-07 15:42:48,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:42:48,535 INFO L462 AbstractCegarLoop]: Abstraction has 12333 states and 37967 transitions. [2019-12-07 15:42:48,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 15:42:48,535 INFO L276 IsEmpty]: Start isEmpty. Operand 12333 states and 37967 transitions. [2019-12-07 15:42:48,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 15:42:48,547 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:42:48,547 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] [2019-12-07 15:42:48,547 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:42:48,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:42:48,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1734091201, now seen corresponding path program 6 times [2019-12-07 15:42:48,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:42:48,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897147350] [2019-12-07 15:42:48,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:42:48,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:42:48,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:42:48,629 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 15:42:48,629 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 15:42:48,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= 0 v_~__unbuffered_cnt~0_95) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2088~0.base_30|) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2088~0.base_30| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2088~0.base_30|) |v_ULTIMATE.start_main_~#t2088~0.offset_22| 0)) |v_#memory_int_23|) (= 0 v_~x~0_240) (= v_~x$r_buff1_thd0~0_309 0) (= v_~weak$$choice2~0_201 0) (= 0 v_~x$w_buff1_used~0_624) (= |v_#valid_64| (store .cse0 |v_ULTIMATE.start_main_~#t2088~0.base_30| 1)) (= 0 v_~x$r_buff1_thd2~0_264) (= v_~y~0_226 0) (= v_~z~0_95 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2088~0.base_30|)) (< 0 |v_#StackHeapBarrier_16|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2088~0.base_30| 4)) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~x$r_buff0_thd3~0_148) (= 0 v_~x$w_buff1~0_328) (= |v_ULTIMATE.start_main_~#t2088~0.offset_22| 0) (= 0 v_~x$r_buff0_thd2~0_323) (= v_~x$flush_delayed~0_62 0) (= 0 v_~x$w_buff0_used~0_913) (= 0 |v_#NULL.base_4|) (= 0 v_~x$read_delayed~0_7) (= v_~x$r_buff0_thd1~0_362 0) (= 0 v_~weak$$choice0~0_37) (= v_~main$tmp_guard1~0_53 0) (= v_~main$tmp_guard0~0_42 0) (= 0 v_~__unbuffered_p0_EAX~0_85) (= 0 v_~__unbuffered_p2_EAX~0_68) (= |v_#NULL.offset_4| 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$r_buff1_thd3~0_267) (= v_~x$mem_tmp~0_40 0) (= v_~x$r_buff1_thd1~0_428 0) (= 0 v_~x$w_buff0~0_403) (= v_~x$r_buff0_thd0~0_156 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_403, ~x$flush_delayed~0=v_~x$flush_delayed~0_62, ULTIMATE.start_main_~#t2090~0.base=|v_ULTIMATE.start_main_~#t2090~0.base_23|, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_428, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_148, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_40|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_85, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_68, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_156, ULTIMATE.start_main_~#t2090~0.offset=|v_ULTIMATE.start_main_~#t2090~0.offset_14|, ~x$w_buff1~0=v_~x$w_buff1~0_328, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_624, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_264, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_37, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_~#t2089~0.offset=|v_ULTIMATE.start_main_~#t2089~0.offset_22|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_95, ~x~0=v_~x~0_240, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_362, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_114|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_267, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_53, ~x$mem_tmp~0=v_~x$mem_tmp~0_40, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_51|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_60|, ULTIMATE.start_main_~#t2088~0.base=|v_ULTIMATE.start_main_~#t2088~0.base_30|, ULTIMATE.start_main_~#t2088~0.offset=|v_ULTIMATE.start_main_~#t2088~0.offset_22|, ~y~0=v_~y~0_226, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_15|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_42, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_309, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_323, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_913, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_62|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_95, ~weak$$choice2~0=v_~weak$$choice2~0_201, ULTIMATE.start_main_~#t2089~0.base=|v_ULTIMATE.start_main_~#t2089~0.base_31|, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_~#t2090~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t2088~0.base, ULTIMATE.start_main_~#t2088~0.offset, #length, ~__unbuffered_p2_EAX~0, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t2090~0.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, ULTIMATE.start_main_~#t2089~0.offset, #valid, ULTIMATE.start_main_#t~nondet38, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x~0, ULTIMATE.start_main_~#t2089~0.base, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 15:42:48,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L818-1-->L820: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2089~0.base_10| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t2089~0.base_10|)) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2089~0.base_10|) 0) (= |v_ULTIMATE.start_main_~#t2089~0.offset_9| 0) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2089~0.base_10| 1) |v_#valid_31|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2089~0.base_10|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2089~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2089~0.base_10|) |v_ULTIMATE.start_main_~#t2089~0.offset_9| 1)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2089~0.offset=|v_ULTIMATE.start_main_~#t2089~0.offset_9|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2089~0.base=|v_ULTIMATE.start_main_~#t2089~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2089~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2089~0.base] because there is no mapped edge [2019-12-07 15:42:48,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] P1ENTRY-->L5-3: Formula: (and (= v_~x$w_buff0~0_21 v_~x$w_buff1~0_19) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_6|) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6)) (= v_~x$w_buff1_used~0_52 v_~x$w_buff0_used~0_98) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_4| (ite (not (and (not (= 0 (mod v_~x$w_buff0_used~0_97 256))) (not (= 0 (mod v_~x$w_buff1_used~0_52 256))))) 1 0)) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_6|) (= 1 v_~x$w_buff0_used~0_97) (= 1 v_~x$w_buff0~0_20)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_21, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_98} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_20, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, ~x$w_buff1~0=v_~x$w_buff1~0_19, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_52, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_97} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-07 15:42:48,633 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L820-1-->L822: Formula: (and (= |v_ULTIMATE.start_main_~#t2090~0.offset_10| 0) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t2090~0.base_11| 4) |v_#length_13|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2090~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2090~0.base_11|) |v_ULTIMATE.start_main_~#t2090~0.offset_10| 2)) |v_#memory_int_13|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2090~0.base_11|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t2090~0.base_11|)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2090~0.base_11| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2090~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t2090~0.offset=|v_ULTIMATE.start_main_~#t2090~0.offset_10|, ULTIMATE.start_main_~#t2090~0.base=|v_ULTIMATE.start_main_~#t2090~0.base_11|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_13|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2090~0.offset, ULTIMATE.start_main_~#t2090~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 15:42:48,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L795-2-->L795-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd3~0_In-791148359 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-791148359 256) 0))) (or (and (= ~x~0_In-791148359 |P2Thread1of1ForFork1_#t~ite32_Out-791148359|) (or .cse0 .cse1)) (and (= ~x$w_buff1~0_In-791148359 |P2Thread1of1ForFork1_#t~ite32_Out-791148359|) (not .cse0) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-791148359, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-791148359, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-791148359, ~x~0=~x~0_In-791148359} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-791148359|, ~x$w_buff1~0=~x$w_buff1~0_In-791148359, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-791148359, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-791148359, ~x~0=~x~0_In-791148359} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 15:42:48,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L795-4-->L796: Formula: (= v_~x~0_21 |v_P2Thread1of1ForFork1_#t~ite32_8|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_8|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_11|, ~x~0=v_~x~0_21} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-07 15:42:48,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L796-->L796-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In1858809408 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1858809408 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1858809408 |P2Thread1of1ForFork1_#t~ite34_Out1858809408|)) (and (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out1858809408|) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1858809408, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1858809408} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out1858809408|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1858809408, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1858809408} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 15:42:48,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L776-->L776-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-482675587 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-482675587 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite28_Out-482675587| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite28_Out-482675587| ~x$w_buff0_used~0_In-482675587)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-482675587, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-482675587} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-482675587, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-482675587|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-482675587} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 15:42:48,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L777-->L777-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd2~0_In-841867374 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-841867374 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-841867374 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-841867374 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite29_Out-841867374| ~x$w_buff1_used~0_In-841867374) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork0_#t~ite29_Out-841867374| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-841867374, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-841867374, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-841867374, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-841867374} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-841867374, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-841867374, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-841867374, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-841867374|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-841867374} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 15:42:48,636 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L778-->L779: Formula: (let ((.cse1 (= ~x$r_buff0_thd2~0_Out763618595 ~x$r_buff0_thd2~0_In763618595)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In763618595 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In763618595 256)))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (= ~x$r_buff0_thd2~0_Out763618595 0) (not .cse2) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In763618595, ~x$w_buff0_used~0=~x$w_buff0_used~0_In763618595} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out763618595|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out763618595, ~x$w_buff0_used~0=~x$w_buff0_used~0_In763618595} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 15:42:48,636 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In-513326958 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In-513326958 256))) (.cse1 (= (mod ~x$r_buff1_thd2~0_In-513326958 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-513326958 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out-513326958|)) (and (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite31_Out-513326958| ~x$r_buff1_thd2~0_In-513326958) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-513326958, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-513326958, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-513326958, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-513326958} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-513326958|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-513326958, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-513326958, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-513326958, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-513326958} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 15:42:48,636 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L779-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= v_~x$r_buff1_thd2~0_46 |v_P1Thread1of1ForFork0_#t~ite31_28|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_27|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_46, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 15:42:48,636 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L740-->L740-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In108298849 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite8_In108298849| |P0Thread1of1ForFork2_#t~ite8_Out108298849|) (= ~x$w_buff0~0_In108298849 |P0Thread1of1ForFork2_#t~ite9_Out108298849|) (not .cse0)) (and (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In108298849 256)))) (or (= (mod ~x$w_buff0_used~0_In108298849 256) 0) (and (= 0 (mod ~x$r_buff1_thd1~0_In108298849 256)) .cse1) (and (= 0 (mod ~x$w_buff1_used~0_In108298849 256)) .cse1))) (= ~x$w_buff0~0_In108298849 |P0Thread1of1ForFork2_#t~ite8_Out108298849|) (= |P0Thread1of1ForFork2_#t~ite9_Out108298849| |P0Thread1of1ForFork2_#t~ite8_Out108298849|) .cse0))) InVars {~x$w_buff0~0=~x$w_buff0~0_In108298849, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In108298849, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_In108298849|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In108298849, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In108298849, ~weak$$choice2~0=~weak$$choice2~0_In108298849, ~x$w_buff0_used~0=~x$w_buff0_used~0_In108298849} OutVars{~x$w_buff0~0=~x$w_buff0~0_In108298849, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In108298849, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out108298849|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In108298849, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out108298849|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In108298849, ~weak$$choice2~0=~weak$$choice2~0_In108298849, ~x$w_buff0_used~0=~x$w_buff0_used~0_In108298849} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-07 15:42:48,637 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L797-->L797-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In-167468437 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In-167468437 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-167468437 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-167468437 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite35_Out-167468437| 0)) (and (= ~x$w_buff1_used~0_In-167468437 |P2Thread1of1ForFork1_#t~ite35_Out-167468437|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-167468437, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-167468437, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-167468437, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-167468437} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-167468437|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-167468437, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-167468437, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-167468437, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-167468437} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 15:42:48,638 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L798-->L798-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In149080008 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In149080008 256)))) (or (and (= ~x$r_buff0_thd3~0_In149080008 |P2Thread1of1ForFork1_#t~ite36_Out149080008|) (or .cse0 .cse1)) (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite36_Out149080008| 0) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In149080008, ~x$w_buff0_used~0=~x$w_buff0_used~0_In149080008} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out149080008|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In149080008, ~x$w_buff0_used~0=~x$w_buff0_used~0_In149080008} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 15:42:48,638 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L799-->L799-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In369661034 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd3~0_In369661034 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd3~0_In369661034 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In369661034 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite37_Out369661034| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite37_Out369661034| ~x$r_buff1_thd3~0_In369661034)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In369661034, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In369661034, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In369661034, ~x$w_buff0_used~0=~x$w_buff0_used~0_In369661034} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out369661034|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In369661034, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In369661034, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In369661034, ~x$w_buff0_used~0=~x$w_buff0_used~0_In369661034} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 15:42:48,638 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L799-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= v_~x$r_buff1_thd3~0_48 |v_P2Thread1of1ForFork1_#t~ite37_28|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_27|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_48, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 15:42:48,639 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L743-->L743-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In532205848 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite17_Out532205848| ~x$w_buff1_used~0_In532205848) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In532205848 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In532205848 256)) (and (= (mod ~x$w_buff1_used~0_In532205848 256) 0) .cse1) (and (= (mod ~x$r_buff1_thd1~0_In532205848 256) 0) .cse1))) (= |P0Thread1of1ForFork2_#t~ite18_Out532205848| |P0Thread1of1ForFork2_#t~ite17_Out532205848|)) (and (= |P0Thread1of1ForFork2_#t~ite17_In532205848| |P0Thread1of1ForFork2_#t~ite17_Out532205848|) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite18_Out532205848| ~x$w_buff1_used~0_In532205848)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In532205848, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In532205848|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In532205848, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In532205848, ~weak$$choice2~0=~weak$$choice2~0_In532205848, ~x$w_buff0_used~0=~x$w_buff0_used~0_In532205848} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In532205848, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out532205848|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out532205848|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In532205848, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In532205848, ~weak$$choice2~0=~weak$$choice2~0_In532205848, ~x$w_buff0_used~0=~x$w_buff0_used~0_In532205848} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-07 15:42:48,639 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L745: Formula: (and (= v_~x$r_buff0_thd1~0_101 v_~x$r_buff0_thd1~0_100) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_101, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_9|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_100, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_6|, ~weak$$choice2~0=v_~weak$$choice2~0_39, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-07 15:42:48,639 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L745-->L745-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-557718895 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite23_In-557718895| |P0Thread1of1ForFork2_#t~ite23_Out-557718895|) (= |P0Thread1of1ForFork2_#t~ite24_Out-557718895| ~x$r_buff1_thd1~0_In-557718895) (not .cse0)) (and (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-557718895 256) 0))) (or (and (= (mod ~x$w_buff1_used~0_In-557718895 256) 0) .cse1) (and (= 0 (mod ~x$r_buff1_thd1~0_In-557718895 256)) .cse1) (= 0 (mod ~x$w_buff0_used~0_In-557718895 256)))) (= ~x$r_buff1_thd1~0_In-557718895 |P0Thread1of1ForFork2_#t~ite23_Out-557718895|) (= |P0Thread1of1ForFork2_#t~ite24_Out-557718895| |P0Thread1of1ForFork2_#t~ite23_Out-557718895|) .cse0))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-557718895, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-557718895, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-557718895, ~weak$$choice2~0=~weak$$choice2~0_In-557718895, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In-557718895|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-557718895} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-557718895, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-557718895, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-557718895, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out-557718895|, ~weak$$choice2~0=~weak$$choice2~0_In-557718895, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out-557718895|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-557718895} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-07 15:42:48,640 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L747-->L755: Formula: (and (= v_~x$flush_delayed~0_17 0) (not (= (mod v_~x$flush_delayed~0_18 256) 0)) (= v_~x~0_34 v_~x$mem_tmp~0_10) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_18, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_10} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_13|, ~x$flush_delayed~0=v_~x$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ~x~0=v_~x~0_34} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 15:42:48,640 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L826-->L828-2: Formula: (and (or (= 0 (mod v_~x$w_buff0_used~0_158 256)) (= 0 (mod v_~x$r_buff0_thd0~0_26 256))) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_158} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_158} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 15:42:48,640 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L828-2-->L828-4: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In542650917 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In542650917 256)))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out542650917| ~x$w_buff1~0_In542650917) (not .cse0) (not .cse1)) (and (= ~x~0_In542650917 |ULTIMATE.start_main_#t~ite41_Out542650917|) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In542650917, ~x$w_buff1_used~0=~x$w_buff1_used~0_In542650917, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In542650917, ~x~0=~x~0_In542650917} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out542650917|, ~x$w_buff1~0=~x$w_buff1~0_In542650917, ~x$w_buff1_used~0=~x$w_buff1_used~0_In542650917, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In542650917, ~x~0=~x~0_In542650917} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 15:42:48,640 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L828-4-->L829: Formula: (= v_~x~0_24 |v_ULTIMATE.start_main_#t~ite41_11|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-07 15:42:48,641 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L829-->L829-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-922534939 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-922534939 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite43_Out-922534939|) (not .cse1)) (and (= ~x$w_buff0_used~0_In-922534939 |ULTIMATE.start_main_#t~ite43_Out-922534939|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-922534939, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-922534939} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-922534939, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-922534939|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-922534939} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 15:42:48,641 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L830-->L830-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In85697320 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In85697320 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In85697320 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd0~0_In85697320 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In85697320 |ULTIMATE.start_main_#t~ite44_Out85697320|) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite44_Out85697320| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In85697320, ~x$w_buff1_used~0=~x$w_buff1_used~0_In85697320, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In85697320, ~x$w_buff0_used~0=~x$w_buff0_used~0_In85697320} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In85697320, ~x$w_buff1_used~0=~x$w_buff1_used~0_In85697320, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In85697320, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out85697320|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In85697320} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 15:42:48,641 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L831-->L831-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1375124403 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1375124403 256)))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out1375124403| ~x$r_buff0_thd0~0_In1375124403) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite45_Out1375124403| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1375124403, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1375124403} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1375124403, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1375124403|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1375124403} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 15:42:48,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L832-->L832-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-244986419 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In-244986419 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-244986419 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-244986419 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite46_Out-244986419| ~x$r_buff1_thd0~0_In-244986419) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite46_Out-244986419| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-244986419, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-244986419, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-244986419, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-244986419} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-244986419, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-244986419|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-244986419, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-244986419, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-244986419} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 15:42:48,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_25 (ite (= (ite (not (and (= v_~z~0_60 2) (= 1 v_~__unbuffered_p2_EAX~0_35) (= 0 v_~__unbuffered_p0_EAX~0_54))) 1 0) 0) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_22 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_22 0) (= v_~x$r_buff1_thd0~0_277 |v_ULTIMATE.start_main_#t~ite46_60|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15| (mod v_~main$tmp_guard1~0_25 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_60|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_35, ~z~0=v_~z~0_60} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_22, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_59|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_35, ~z~0=v_~z~0_60, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_277, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 15:42:48,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 03:42:48 BasicIcfg [2019-12-07 15:42:48,689 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 15:42:48,689 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 15:42:48,689 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 15:42:48,689 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 15:42:48,690 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:40:55" (3/4) ... [2019-12-07 15:42:48,691 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 15:42:48,692 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_66| 0 0))) (and (= 0 v_~__unbuffered_cnt~0_95) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t2088~0.base_30|) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2088~0.base_30| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2088~0.base_30|) |v_ULTIMATE.start_main_~#t2088~0.offset_22| 0)) |v_#memory_int_23|) (= 0 v_~x~0_240) (= v_~x$r_buff1_thd0~0_309 0) (= v_~weak$$choice2~0_201 0) (= 0 v_~x$w_buff1_used~0_624) (= |v_#valid_64| (store .cse0 |v_ULTIMATE.start_main_~#t2088~0.base_30| 1)) (= 0 v_~x$r_buff1_thd2~0_264) (= v_~y~0_226 0) (= v_~z~0_95 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2088~0.base_30|)) (< 0 |v_#StackHeapBarrier_16|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2088~0.base_30| 4)) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~x$r_buff0_thd3~0_148) (= 0 v_~x$w_buff1~0_328) (= |v_ULTIMATE.start_main_~#t2088~0.offset_22| 0) (= 0 v_~x$r_buff0_thd2~0_323) (= v_~x$flush_delayed~0_62 0) (= 0 v_~x$w_buff0_used~0_913) (= 0 |v_#NULL.base_4|) (= 0 v_~x$read_delayed~0_7) (= v_~x$r_buff0_thd1~0_362 0) (= 0 v_~weak$$choice0~0_37) (= v_~main$tmp_guard1~0_53 0) (= v_~main$tmp_guard0~0_42 0) (= 0 v_~__unbuffered_p0_EAX~0_85) (= 0 v_~__unbuffered_p2_EAX~0_68) (= |v_#NULL.offset_4| 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$r_buff1_thd3~0_267) (= v_~x$mem_tmp~0_40 0) (= v_~x$r_buff1_thd1~0_428 0) (= 0 v_~x$w_buff0~0_403) (= v_~x$r_buff0_thd0~0_156 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_403, ~x$flush_delayed~0=v_~x$flush_delayed~0_62, ULTIMATE.start_main_~#t2090~0.base=|v_ULTIMATE.start_main_~#t2090~0.base_23|, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_428, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_148, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_40|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_85, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_68, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_156, ULTIMATE.start_main_~#t2090~0.offset=|v_ULTIMATE.start_main_~#t2090~0.offset_14|, ~x$w_buff1~0=v_~x$w_buff1~0_328, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_624, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_264, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_37, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_~#t2089~0.offset=|v_ULTIMATE.start_main_~#t2089~0.offset_22|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_95, ~x~0=v_~x~0_240, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_362, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_114|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_267, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_53, ~x$mem_tmp~0=v_~x$mem_tmp~0_40, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_51|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_60|, ULTIMATE.start_main_~#t2088~0.base=|v_ULTIMATE.start_main_~#t2088~0.base_30|, ULTIMATE.start_main_~#t2088~0.offset=|v_ULTIMATE.start_main_~#t2088~0.offset_22|, ~y~0=v_~y~0_226, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_15|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_42, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_309, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_323, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_913, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_62|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_95, ~weak$$choice2~0=v_~weak$$choice2~0_201, ULTIMATE.start_main_~#t2089~0.base=|v_ULTIMATE.start_main_~#t2089~0.base_31|, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_~#t2090~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t2088~0.base, ULTIMATE.start_main_~#t2088~0.offset, #length, ~__unbuffered_p2_EAX~0, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t2090~0.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, ULTIMATE.start_main_~#t2089~0.offset, #valid, ULTIMATE.start_main_#t~nondet38, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x~0, ULTIMATE.start_main_~#t2089~0.base, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 15:42:48,692 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L818-1-->L820: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2089~0.base_10| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t2089~0.base_10|)) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2089~0.base_10|) 0) (= |v_ULTIMATE.start_main_~#t2089~0.offset_9| 0) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2089~0.base_10| 1) |v_#valid_31|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2089~0.base_10|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2089~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2089~0.base_10|) |v_ULTIMATE.start_main_~#t2089~0.offset_9| 1)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2089~0.offset=|v_ULTIMATE.start_main_~#t2089~0.offset_9|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2089~0.base=|v_ULTIMATE.start_main_~#t2089~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2089~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2089~0.base] because there is no mapped edge [2019-12-07 15:42:48,692 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] P1ENTRY-->L5-3: Formula: (and (= v_~x$w_buff0~0_21 v_~x$w_buff1~0_19) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_6|) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6)) (= v_~x$w_buff1_used~0_52 v_~x$w_buff0_used~0_98) (= |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_4| (ite (not (and (not (= 0 (mod v_~x$w_buff0_used~0_97 256))) (not (= 0 (mod v_~x$w_buff1_used~0_52 256))))) 1 0)) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_6|) (= 1 v_~x$w_buff0_used~0_97) (= 1 v_~x$w_buff0~0_20)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_21, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_98} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_20, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_4|, ~x$w_buff1~0=v_~x$w_buff1~0_19, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_52, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_97} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-07 15:42:48,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L820-1-->L822: Formula: (and (= |v_ULTIMATE.start_main_~#t2090~0.offset_10| 0) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t2090~0.base_11| 4) |v_#length_13|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2090~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2090~0.base_11|) |v_ULTIMATE.start_main_~#t2090~0.offset_10| 2)) |v_#memory_int_13|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2090~0.base_11|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t2090~0.base_11|)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2090~0.base_11| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2090~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t2090~0.offset=|v_ULTIMATE.start_main_~#t2090~0.offset_10|, ULTIMATE.start_main_~#t2090~0.base=|v_ULTIMATE.start_main_~#t2090~0.base_11|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_13|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2090~0.offset, ULTIMATE.start_main_~#t2090~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 15:42:48,694 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L795-2-->L795-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd3~0_In-791148359 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-791148359 256) 0))) (or (and (= ~x~0_In-791148359 |P2Thread1of1ForFork1_#t~ite32_Out-791148359|) (or .cse0 .cse1)) (and (= ~x$w_buff1~0_In-791148359 |P2Thread1of1ForFork1_#t~ite32_Out-791148359|) (not .cse0) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-791148359, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-791148359, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-791148359, ~x~0=~x~0_In-791148359} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-791148359|, ~x$w_buff1~0=~x$w_buff1~0_In-791148359, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-791148359, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-791148359, ~x~0=~x~0_In-791148359} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 15:42:48,694 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L795-4-->L796: Formula: (= v_~x~0_21 |v_P2Thread1of1ForFork1_#t~ite32_8|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_8|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_11|, ~x~0=v_~x~0_21} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-07 15:42:48,694 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L796-->L796-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In1858809408 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1858809408 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1858809408 |P2Thread1of1ForFork1_#t~ite34_Out1858809408|)) (and (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out1858809408|) (not .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1858809408, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1858809408} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out1858809408|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1858809408, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1858809408} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 15:42:48,695 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L776-->L776-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-482675587 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-482675587 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite28_Out-482675587| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite28_Out-482675587| ~x$w_buff0_used~0_In-482675587)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-482675587, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-482675587} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-482675587, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-482675587|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-482675587} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 15:42:48,695 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L777-->L777-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd2~0_In-841867374 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-841867374 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-841867374 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-841867374 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite29_Out-841867374| ~x$w_buff1_used~0_In-841867374) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork0_#t~ite29_Out-841867374| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-841867374, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-841867374, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-841867374, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-841867374} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-841867374, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-841867374, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-841867374, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-841867374|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-841867374} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 15:42:48,695 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L778-->L779: Formula: (let ((.cse1 (= ~x$r_buff0_thd2~0_Out763618595 ~x$r_buff0_thd2~0_In763618595)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In763618595 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In763618595 256)))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (= ~x$r_buff0_thd2~0_Out763618595 0) (not .cse2) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In763618595, ~x$w_buff0_used~0=~x$w_buff0_used~0_In763618595} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out763618595|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out763618595, ~x$w_buff0_used~0=~x$w_buff0_used~0_In763618595} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 15:42:48,696 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L779-->L779-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In-513326958 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In-513326958 256))) (.cse1 (= (mod ~x$r_buff1_thd2~0_In-513326958 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-513326958 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out-513326958|)) (and (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite31_Out-513326958| ~x$r_buff1_thd2~0_In-513326958) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-513326958, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-513326958, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-513326958, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-513326958} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-513326958|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-513326958, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-513326958, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-513326958, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-513326958} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 15:42:48,696 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L779-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= v_~x$r_buff1_thd2~0_46 |v_P1Thread1of1ForFork0_#t~ite31_28|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_27|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_46, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 15:42:48,696 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L740-->L740-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In108298849 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite8_In108298849| |P0Thread1of1ForFork2_#t~ite8_Out108298849|) (= ~x$w_buff0~0_In108298849 |P0Thread1of1ForFork2_#t~ite9_Out108298849|) (not .cse0)) (and (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In108298849 256)))) (or (= (mod ~x$w_buff0_used~0_In108298849 256) 0) (and (= 0 (mod ~x$r_buff1_thd1~0_In108298849 256)) .cse1) (and (= 0 (mod ~x$w_buff1_used~0_In108298849 256)) .cse1))) (= ~x$w_buff0~0_In108298849 |P0Thread1of1ForFork2_#t~ite8_Out108298849|) (= |P0Thread1of1ForFork2_#t~ite9_Out108298849| |P0Thread1of1ForFork2_#t~ite8_Out108298849|) .cse0))) InVars {~x$w_buff0~0=~x$w_buff0~0_In108298849, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In108298849, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_In108298849|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In108298849, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In108298849, ~weak$$choice2~0=~weak$$choice2~0_In108298849, ~x$w_buff0_used~0=~x$w_buff0_used~0_In108298849} OutVars{~x$w_buff0~0=~x$w_buff0~0_In108298849, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In108298849, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out108298849|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In108298849, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out108298849|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In108298849, ~weak$$choice2~0=~weak$$choice2~0_In108298849, ~x$w_buff0_used~0=~x$w_buff0_used~0_In108298849} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-07 15:42:48,697 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L797-->L797-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In-167468437 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In-167468437 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-167468437 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-167468437 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite35_Out-167468437| 0)) (and (= ~x$w_buff1_used~0_In-167468437 |P2Thread1of1ForFork1_#t~ite35_Out-167468437|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-167468437, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-167468437, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-167468437, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-167468437} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-167468437|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-167468437, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-167468437, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-167468437, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-167468437} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 15:42:48,698 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L798-->L798-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In149080008 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In149080008 256)))) (or (and (= ~x$r_buff0_thd3~0_In149080008 |P2Thread1of1ForFork1_#t~ite36_Out149080008|) (or .cse0 .cse1)) (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite36_Out149080008| 0) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In149080008, ~x$w_buff0_used~0=~x$w_buff0_used~0_In149080008} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out149080008|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In149080008, ~x$w_buff0_used~0=~x$w_buff0_used~0_In149080008} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 15:42:48,698 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L799-->L799-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In369661034 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd3~0_In369661034 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd3~0_In369661034 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In369661034 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite37_Out369661034| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite37_Out369661034| ~x$r_buff1_thd3~0_In369661034)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In369661034, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In369661034, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In369661034, ~x$w_buff0_used~0=~x$w_buff0_used~0_In369661034} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out369661034|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In369661034, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In369661034, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In369661034, ~x$w_buff0_used~0=~x$w_buff0_used~0_In369661034} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 15:42:48,698 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L799-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= v_~x$r_buff1_thd3~0_48 |v_P2Thread1of1ForFork1_#t~ite37_28|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_27|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_48, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 15:42:48,699 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L743-->L743-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In532205848 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite17_Out532205848| ~x$w_buff1_used~0_In532205848) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In532205848 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In532205848 256)) (and (= (mod ~x$w_buff1_used~0_In532205848 256) 0) .cse1) (and (= (mod ~x$r_buff1_thd1~0_In532205848 256) 0) .cse1))) (= |P0Thread1of1ForFork2_#t~ite18_Out532205848| |P0Thread1of1ForFork2_#t~ite17_Out532205848|)) (and (= |P0Thread1of1ForFork2_#t~ite17_In532205848| |P0Thread1of1ForFork2_#t~ite17_Out532205848|) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite18_Out532205848| ~x$w_buff1_used~0_In532205848)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In532205848, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In532205848|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In532205848, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In532205848, ~weak$$choice2~0=~weak$$choice2~0_In532205848, ~x$w_buff0_used~0=~x$w_buff0_used~0_In532205848} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In532205848, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out532205848|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out532205848|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In532205848, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In532205848, ~weak$$choice2~0=~weak$$choice2~0_In532205848, ~x$w_buff0_used~0=~x$w_buff0_used~0_In532205848} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-07 15:42:48,699 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L745: Formula: (and (= v_~x$r_buff0_thd1~0_101 v_~x$r_buff0_thd1~0_100) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_101, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_9|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_100, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_6|, ~weak$$choice2~0=v_~weak$$choice2~0_39, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-07 15:42:48,699 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L745-->L745-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-557718895 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite23_In-557718895| |P0Thread1of1ForFork2_#t~ite23_Out-557718895|) (= |P0Thread1of1ForFork2_#t~ite24_Out-557718895| ~x$r_buff1_thd1~0_In-557718895) (not .cse0)) (and (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-557718895 256) 0))) (or (and (= (mod ~x$w_buff1_used~0_In-557718895 256) 0) .cse1) (and (= 0 (mod ~x$r_buff1_thd1~0_In-557718895 256)) .cse1) (= 0 (mod ~x$w_buff0_used~0_In-557718895 256)))) (= ~x$r_buff1_thd1~0_In-557718895 |P0Thread1of1ForFork2_#t~ite23_Out-557718895|) (= |P0Thread1of1ForFork2_#t~ite24_Out-557718895| |P0Thread1of1ForFork2_#t~ite23_Out-557718895|) .cse0))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-557718895, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-557718895, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-557718895, ~weak$$choice2~0=~weak$$choice2~0_In-557718895, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In-557718895|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-557718895} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-557718895, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-557718895, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-557718895, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out-557718895|, ~weak$$choice2~0=~weak$$choice2~0_In-557718895, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out-557718895|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-557718895} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-07 15:42:48,700 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L747-->L755: Formula: (and (= v_~x$flush_delayed~0_17 0) (not (= (mod v_~x$flush_delayed~0_18 256) 0)) (= v_~x~0_34 v_~x$mem_tmp~0_10) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_18, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_10} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_13|, ~x$flush_delayed~0=v_~x$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ~x~0=v_~x~0_34} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 15:42:48,700 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L826-->L828-2: Formula: (and (or (= 0 (mod v_~x$w_buff0_used~0_158 256)) (= 0 (mod v_~x$r_buff0_thd0~0_26 256))) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_158} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_158} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 15:42:48,700 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L828-2-->L828-4: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In542650917 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In542650917 256)))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out542650917| ~x$w_buff1~0_In542650917) (not .cse0) (not .cse1)) (and (= ~x~0_In542650917 |ULTIMATE.start_main_#t~ite41_Out542650917|) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In542650917, ~x$w_buff1_used~0=~x$w_buff1_used~0_In542650917, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In542650917, ~x~0=~x~0_In542650917} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out542650917|, ~x$w_buff1~0=~x$w_buff1~0_In542650917, ~x$w_buff1_used~0=~x$w_buff1_used~0_In542650917, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In542650917, ~x~0=~x~0_In542650917} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-07 15:42:48,700 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L828-4-->L829: Formula: (= v_~x~0_24 |v_ULTIMATE.start_main_#t~ite41_11|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-07 15:42:48,700 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L829-->L829-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-922534939 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-922534939 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite43_Out-922534939|) (not .cse1)) (and (= ~x$w_buff0_used~0_In-922534939 |ULTIMATE.start_main_#t~ite43_Out-922534939|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-922534939, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-922534939} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-922534939, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-922534939|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-922534939} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 15:42:48,701 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L830-->L830-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In85697320 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In85697320 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In85697320 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd0~0_In85697320 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In85697320 |ULTIMATE.start_main_#t~ite44_Out85697320|) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite44_Out85697320| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In85697320, ~x$w_buff1_used~0=~x$w_buff1_used~0_In85697320, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In85697320, ~x$w_buff0_used~0=~x$w_buff0_used~0_In85697320} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In85697320, ~x$w_buff1_used~0=~x$w_buff1_used~0_In85697320, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In85697320, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out85697320|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In85697320} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 15:42:48,701 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L831-->L831-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1375124403 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1375124403 256)))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out1375124403| ~x$r_buff0_thd0~0_In1375124403) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite45_Out1375124403| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1375124403, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1375124403} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1375124403, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1375124403|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1375124403} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 15:42:48,701 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L832-->L832-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-244986419 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In-244986419 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-244986419 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-244986419 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite46_Out-244986419| ~x$r_buff1_thd0~0_In-244986419) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite46_Out-244986419| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-244986419, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-244986419, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-244986419, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-244986419} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-244986419, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-244986419|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-244986419, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-244986419, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-244986419} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 15:42:48,701 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_25 (ite (= (ite (not (and (= v_~z~0_60 2) (= 1 v_~__unbuffered_p2_EAX~0_35) (= 0 v_~__unbuffered_p0_EAX~0_54))) 1 0) 0) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_22 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_22 0) (= v_~x$r_buff1_thd0~0_277 |v_ULTIMATE.start_main_#t~ite46_60|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15| (mod v_~main$tmp_guard1~0_25 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_60|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_35, ~z~0=v_~z~0_60} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_22, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_59|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_35, ~z~0=v_~z~0_60, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_277, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 15:42:48,749 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_12103cdb-b14c-45d2-a310-e4548c8f4edd/bin/uautomizer/witness.graphml [2019-12-07 15:42:48,750 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 15:42:48,751 INFO L168 Benchmark]: Toolchain (without parser) took 114172.94 ms. Allocated memory was 1.0 GB in the beginning and 7.7 GB in the end (delta: 6.7 GB). Free memory was 939.3 MB in the beginning and 3.7 GB in the end (delta: -2.7 GB). Peak memory consumption was 3.9 GB. Max. memory is 11.5 GB. [2019-12-07 15:42:48,751 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 15:42:48,751 INFO L168 Benchmark]: CACSL2BoogieTranslator took 440.50 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -147.1 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 15:42:48,752 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.70 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 15:42:48,752 INFO L168 Benchmark]: Boogie Preprocessor took 27.83 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 15:42:48,752 INFO L168 Benchmark]: RCFGBuilder took 397.00 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: 54.7 MB). Peak memory consumption was 54.7 MB. Max. memory is 11.5 GB. [2019-12-07 15:42:48,752 INFO L168 Benchmark]: TraceAbstraction took 113206.12 ms. Allocated memory was 1.1 GB in the beginning and 7.7 GB in the end (delta: 6.5 GB). Free memory was 1.0 GB in the beginning and 3.7 GB in the end (delta: -2.7 GB). Peak memory consumption was 3.9 GB. Max. memory is 11.5 GB. [2019-12-07 15:42:48,753 INFO L168 Benchmark]: Witness Printer took 60.52 ms. Allocated memory is still 7.7 GB. Free memory was 3.7 GB in the beginning and 3.7 GB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. [2019-12-07 15:42:48,754 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 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 440.50 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -147.1 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.70 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.83 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 397.00 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: 54.7 MB). Peak memory consumption was 54.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 113206.12 ms. Allocated memory was 1.1 GB in the beginning and 7.7 GB in the end (delta: 6.5 GB). Free memory was 1.0 GB in the beginning and 3.7 GB in the end (delta: -2.7 GB). Peak memory consumption was 3.9 GB. Max. memory is 11.5 GB. * Witness Printer took 60.52 ms. Allocated memory is still 7.7 GB. Free memory was 3.7 GB in the beginning and 3.7 GB in the end (delta: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.3s, 163 ProgramPointsBefore, 83 ProgramPointsAfterwards, 194 TransitionsBefore, 92 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 26 ChoiceCompositions, 6709 VarBasedMoverChecksPositive, 292 VarBasedMoverChecksNegative, 116 SemBasedMoverChecksPositive, 259 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.0s, 0 MoverChecksTotal, 66094 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t2088, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L820] FCALL, FORK 0 pthread_create(&t2089, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L769] 2 x$r_buff0_thd2 = (_Bool)1 [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L822] FCALL, FORK 0 pthread_create(&t2090, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L789] 3 __unbuffered_p2_EAX = y [L792] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L795] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L730] 1 z = 2 [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L796] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L742] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EAX = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L824] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L829] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 154 locations, 2 error locations. Result: UNSAFE, OverallTime: 113.0s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 30.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4080 SDtfs, 6009 SDslu, 12815 SDs, 0 SdLazy, 10498 SolverSat, 292 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 279 GetRequests, 23 SyntacticMatches, 16 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2787 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=258617occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 66.7s AutomataMinimizationTime, 22 MinimizatonAttempts, 207139 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 763 NumberOfCodeBlocks, 763 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 685 ConstructedInterpolants, 0 QuantifiedInterpolants, 209589 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...