./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix020_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_cd74bc8b-511c-41e7-b9f4-2dedb1f36722/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_cd74bc8b-511c-41e7-b9f4-2dedb1f36722/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_cd74bc8b-511c-41e7-b9f4-2dedb1f36722/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_cd74bc8b-511c-41e7-b9f4-2dedb1f36722/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix020_tso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_cd74bc8b-511c-41e7-b9f4-2dedb1f36722/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_cd74bc8b-511c-41e7-b9f4-2dedb1f36722/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 ea918d42d933f4ed9b4e29895b4572173e51bd23 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 16:31:32,235 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 16:31:32,236 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 16:31:32,244 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 16:31:32,245 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 16:31:32,245 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 16:31:32,246 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 16:31:32,248 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 16:31:32,249 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 16:31:32,249 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 16:31:32,250 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 16:31:32,251 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 16:31:32,251 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 16:31:32,252 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 16:31:32,252 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 16:31:32,253 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 16:31:32,253 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 16:31:32,254 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 16:31:32,255 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 16:31:32,257 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 16:31:32,258 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 16:31:32,258 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 16:31:32,259 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 16:31:32,259 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 16:31:32,261 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 16:31:32,261 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 16:31:32,261 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 16:31:32,262 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 16:31:32,262 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 16:31:32,263 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 16:31:32,263 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 16:31:32,263 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 16:31:32,264 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 16:31:32,264 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 16:31:32,265 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 16:31:32,265 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 16:31:32,265 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 16:31:32,265 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 16:31:32,265 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 16:31:32,266 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 16:31:32,266 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 16:31:32,267 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_cd74bc8b-511c-41e7-b9f4-2dedb1f36722/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 16:31:32,276 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 16:31:32,276 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 16:31:32,277 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 16:31:32,277 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 16:31:32,277 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 16:31:32,278 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 16:31:32,278 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 16:31:32,278 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 16:31:32,278 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 16:31:32,278 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 16:31:32,278 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 16:31:32,278 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 16:31:32,278 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 16:31:32,279 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 16:31:32,279 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 16:31:32,279 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 16:31:32,279 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 16:31:32,279 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 16:31:32,279 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 16:31:32,279 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 16:31:32,280 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 16:31:32,280 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:31:32,280 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 16:31:32,280 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 16:31:32,280 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 16:31:32,280 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 16:31:32,280 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 16:31:32,280 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 16:31:32,280 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 16:31:32,280 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_cd74bc8b-511c-41e7-b9f4-2dedb1f36722/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 -> ea918d42d933f4ed9b4e29895b4572173e51bd23 [2019-12-07 16:31:32,378 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 16:31:32,387 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 16:31:32,389 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 16:31:32,390 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 16:31:32,390 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 16:31:32,391 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_cd74bc8b-511c-41e7-b9f4-2dedb1f36722/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix020_tso.opt.i [2019-12-07 16:31:32,429 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_cd74bc8b-511c-41e7-b9f4-2dedb1f36722/bin/uautomizer/data/8d3cffcf7/a649c8bf842b43fe9b50a5ad6078a1d5/FLAG741e70b79 [2019-12-07 16:31:32,820 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 16:31:32,821 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_cd74bc8b-511c-41e7-b9f4-2dedb1f36722/sv-benchmarks/c/pthread-wmm/mix020_tso.opt.i [2019-12-07 16:31:32,831 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_cd74bc8b-511c-41e7-b9f4-2dedb1f36722/bin/uautomizer/data/8d3cffcf7/a649c8bf842b43fe9b50a5ad6078a1d5/FLAG741e70b79 [2019-12-07 16:31:33,221 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_cd74bc8b-511c-41e7-b9f4-2dedb1f36722/bin/uautomizer/data/8d3cffcf7/a649c8bf842b43fe9b50a5ad6078a1d5 [2019-12-07 16:31:33,227 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 16:31:33,229 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 16:31:33,230 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 16:31:33,231 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 16:31:33,234 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 16:31:33,235 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:31:33" (1/1) ... [2019-12-07 16:31:33,238 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53457aa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:31:33, skipping insertion in model container [2019-12-07 16:31:33,238 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:31:33" (1/1) ... [2019-12-07 16:31:33,245 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 16:31:33,276 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 16:31:33,524 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:31:33,532 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 16:31:33,579 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:31:33,626 INFO L208 MainTranslator]: Completed translation [2019-12-07 16:31:33,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:31:33 WrapperNode [2019-12-07 16:31:33,627 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 16:31:33,627 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 16:31:33,627 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 16:31:33,627 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 16:31:33,633 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:31:33" (1/1) ... [2019-12-07 16:31:33,648 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:31:33" (1/1) ... [2019-12-07 16:31:33,672 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 16:31:33,672 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 16:31:33,672 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 16:31:33,672 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 16:31:33,679 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:31:33" (1/1) ... [2019-12-07 16:31:33,679 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:31:33" (1/1) ... [2019-12-07 16:31:33,683 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:31:33" (1/1) ... [2019-12-07 16:31:33,683 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:31:33" (1/1) ... [2019-12-07 16:31:33,691 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:31:33" (1/1) ... [2019-12-07 16:31:33,694 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:31:33" (1/1) ... [2019-12-07 16:31:33,697 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:31:33" (1/1) ... [2019-12-07 16:31:33,701 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 16:31:33,701 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 16:31:33,701 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 16:31:33,701 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 16:31:33,702 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:31:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cd74bc8b-511c-41e7-b9f4-2dedb1f36722/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 16:31:33,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 16:31:33,748 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 16:31:33,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 16:31:33,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 16:31:33,748 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 16:31:33,748 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 16:31:33,748 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 16:31:33,748 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 16:31:33,748 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 16:31:33,748 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 16:31:33,749 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 16:31:33,749 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 16:31:33,749 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 16:31:33,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 16:31:33,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 16:31:33,750 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 16:31:34,153 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 16:31:34,153 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 16:31:34,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:31:34 BoogieIcfgContainer [2019-12-07 16:31:34,154 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 16:31:34,155 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 16:31:34,155 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 16:31:34,157 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 16:31:34,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 04:31:33" (1/3) ... [2019-12-07 16:31:34,157 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18b88f71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:31:34, skipping insertion in model container [2019-12-07 16:31:34,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:31:33" (2/3) ... [2019-12-07 16:31:34,158 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18b88f71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:31:34, skipping insertion in model container [2019-12-07 16:31:34,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:31:34" (3/3) ... [2019-12-07 16:31:34,159 INFO L109 eAbstractionObserver]: Analyzing ICFG mix020_tso.opt.i [2019-12-07 16:31:34,165 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 16:31:34,165 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 16:31:34,170 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 16:31:34,170 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 16:31:34,198 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,198 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,198 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,198 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,199 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,199 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,199 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,199 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,200 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,200 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,200 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,201 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,202 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,203 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,204 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,205 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,211 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,211 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,211 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,211 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,211 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,211 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,212 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,212 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,212 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,212 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,212 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,212 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,212 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,212 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,212 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,213 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,213 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,213 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,213 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,213 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,213 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,213 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,213 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,213 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,213 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,213 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,214 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,214 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,214 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,214 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,214 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,214 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,214 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,214 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,214 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,215 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,215 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,215 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,215 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,215 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,215 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,215 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,215 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,215 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,215 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,216 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,216 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,216 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,216 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,216 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,216 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,216 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,216 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,216 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,216 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,216 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,217 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,217 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,217 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,217 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,217 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,217 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,217 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,217 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,217 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,217 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,218 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,218 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,218 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,218 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,218 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,218 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,218 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,218 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,218 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,218 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,218 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,219 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,219 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,219 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,219 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,219 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,219 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,219 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,219 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,219 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,219 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,220 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,220 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,220 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,220 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,220 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,220 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,220 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,220 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,220 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,220 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,220 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,221 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,221 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,221 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,221 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,221 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,221 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,221 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,221 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,221 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,221 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,221 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,222 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,222 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,222 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,222 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,222 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,222 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,222 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,222 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,222 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,223 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,223 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,223 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,223 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:31:34,234 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 16:31:34,247 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 16:31:34,247 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 16:31:34,247 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 16:31:34,247 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 16:31:34,247 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 16:31:34,247 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 16:31:34,247 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 16:31:34,247 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 16:31:34,259 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 211 places, 254 transitions [2019-12-07 16:31:34,260 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 211 places, 254 transitions [2019-12-07 16:31:34,325 INFO L134 PetriNetUnfolder]: 56/250 cut-off events. [2019-12-07 16:31:34,325 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 16:31:34,338 INFO L76 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 250 events. 56/250 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 928 event pairs. 12/204 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 16:31:34,361 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 211 places, 254 transitions [2019-12-07 16:31:34,399 INFO L134 PetriNetUnfolder]: 56/250 cut-off events. [2019-12-07 16:31:34,399 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 16:31:34,407 INFO L76 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 250 events. 56/250 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 928 event pairs. 12/204 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 16:31:34,433 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 26510 [2019-12-07 16:31:34,434 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 16:31:38,094 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-12-07 16:31:38,388 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-07 16:31:38,498 INFO L206 etLargeBlockEncoding]: Checked pairs total: 142340 [2019-12-07 16:31:38,498 INFO L214 etLargeBlockEncoding]: Total number of compositions: 134 [2019-12-07 16:31:38,501 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 112 places, 131 transitions [2019-12-07 16:31:46,928 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 90046 states. [2019-12-07 16:31:46,930 INFO L276 IsEmpty]: Start isEmpty. Operand 90046 states. [2019-12-07 16:31:46,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 16:31:46,934 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:31:46,935 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:31:46,935 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:31:46,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:31:46,939 INFO L82 PathProgramCache]: Analyzing trace with hash 259811849, now seen corresponding path program 1 times [2019-12-07 16:31:46,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:31:46,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156334653] [2019-12-07 16:31:46,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:31:47,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:31:47,097 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 16:31:47,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156334653] [2019-12-07 16:31:47,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:31:47,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 16:31:47,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113582747] [2019-12-07 16:31:47,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:31:47,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:31:47,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:31:47,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:31:47,113 INFO L87 Difference]: Start difference. First operand 90046 states. Second operand 3 states. [2019-12-07 16:31:47,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:31:47,877 INFO L93 Difference]: Finished difference Result 89182 states and 411616 transitions. [2019-12-07 16:31:47,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:31:47,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 16:31:47,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:31:48,377 INFO L225 Difference]: With dead ends: 89182 [2019-12-07 16:31:48,378 INFO L226 Difference]: Without dead ends: 83470 [2019-12-07 16:31:48,378 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 16:31:49,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83470 states. [2019-12-07 16:31:51,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83470 to 83470. [2019-12-07 16:31:51,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83470 states. [2019-12-07 16:31:51,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83470 states to 83470 states and 385016 transitions. [2019-12-07 16:31:51,546 INFO L78 Accepts]: Start accepts. Automaton has 83470 states and 385016 transitions. Word has length 9 [2019-12-07 16:31:51,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:31:51,548 INFO L462 AbstractCegarLoop]: Abstraction has 83470 states and 385016 transitions. [2019-12-07 16:31:51,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:31:51,548 INFO L276 IsEmpty]: Start isEmpty. Operand 83470 states and 385016 transitions. [2019-12-07 16:31:51,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 16:31:51,554 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:31:51,554 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:31:51,554 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:31:51,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:31:51,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1558204525, now seen corresponding path program 1 times [2019-12-07 16:31:51,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:31:51,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277955240] [2019-12-07 16:31:51,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:31:51,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:31:51,616 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 16:31:51,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277955240] [2019-12-07 16:31:51,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:31:51,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:31:51,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828248307] [2019-12-07 16:31:51,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:31:51,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:31:51,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:31:51,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:31:51,618 INFO L87 Difference]: Start difference. First operand 83470 states and 385016 transitions. Second operand 4 states. [2019-12-07 16:31:54,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:31:54,198 INFO L93 Difference]: Finished difference Result 129310 states and 576248 transitions. [2019-12-07 16:31:54,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:31:54,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 16:31:54,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:31:54,563 INFO L225 Difference]: With dead ends: 129310 [2019-12-07 16:31:54,563 INFO L226 Difference]: Without dead ends: 129254 [2019-12-07 16:31:54,563 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 16:31:56,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129254 states. [2019-12-07 16:31:58,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129254 to 124642. [2019-12-07 16:31:58,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124642 states. [2019-12-07 16:31:58,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124642 states to 124642 states and 558856 transitions. [2019-12-07 16:31:58,592 INFO L78 Accepts]: Start accepts. Automaton has 124642 states and 558856 transitions. Word has length 15 [2019-12-07 16:31:58,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:31:58,593 INFO L462 AbstractCegarLoop]: Abstraction has 124642 states and 558856 transitions. [2019-12-07 16:31:58,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:31:58,593 INFO L276 IsEmpty]: Start isEmpty. Operand 124642 states and 558856 transitions. [2019-12-07 16:31:58,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 16:31:58,599 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:31:58,599 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 16:31:58,599 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:31:58,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:31:58,599 INFO L82 PathProgramCache]: Analyzing trace with hash -545556496, now seen corresponding path program 1 times [2019-12-07 16:31:58,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:31:58,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172086932] [2019-12-07 16:31:58,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:31:58,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:31:58,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:31:58,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172086932] [2019-12-07 16:31:58,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:31:58,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:31:58,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987697030] [2019-12-07 16:31:58,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:31:58,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:31:58,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:31:58,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:31:58,646 INFO L87 Difference]: Start difference. First operand 124642 states and 558856 transitions. Second operand 4 states. [2019-12-07 16:31:59,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:31:59,541 INFO L93 Difference]: Finished difference Result 158782 states and 702836 transitions. [2019-12-07 16:31:59,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:31:59,541 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 16:31:59,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:32:00,024 INFO L225 Difference]: With dead ends: 158782 [2019-12-07 16:32:00,024 INFO L226 Difference]: Without dead ends: 158730 [2019-12-07 16:32:00,024 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 16:32:02,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158730 states. [2019-12-07 16:32:06,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158730 to 142378. [2019-12-07 16:32:06,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142378 states. [2019-12-07 16:32:06,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142378 states to 142378 states and 635380 transitions. [2019-12-07 16:32:06,596 INFO L78 Accepts]: Start accepts. Automaton has 142378 states and 635380 transitions. Word has length 18 [2019-12-07 16:32:06,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:32:06,597 INFO L462 AbstractCegarLoop]: Abstraction has 142378 states and 635380 transitions. [2019-12-07 16:32:06,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:32:06,597 INFO L276 IsEmpty]: Start isEmpty. Operand 142378 states and 635380 transitions. [2019-12-07 16:32:06,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 16:32:06,606 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:32:06,606 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 16:32:06,607 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:32:06,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:32:06,607 INFO L82 PathProgramCache]: Analyzing trace with hash 267646308, now seen corresponding path program 1 times [2019-12-07 16:32:06,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:32:06,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279708902] [2019-12-07 16:32:06,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:32:06,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:32:06,636 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 16:32:06,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279708902] [2019-12-07 16:32:06,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:32:06,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:32:06,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897025014] [2019-12-07 16:32:06,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:32:06,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:32:06,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:32:06,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:32:06,637 INFO L87 Difference]: Start difference. First operand 142378 states and 635380 transitions. Second operand 3 states. [2019-12-07 16:32:07,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:32:07,898 INFO L93 Difference]: Finished difference Result 243978 states and 1046540 transitions. [2019-12-07 16:32:07,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:32:07,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 16:32:07,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:32:09,050 INFO L225 Difference]: With dead ends: 243978 [2019-12-07 16:32:09,050 INFO L226 Difference]: Without dead ends: 243978 [2019-12-07 16:32:09,050 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 16:32:11,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243978 states. [2019-12-07 16:32:16,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243978 to 220082. [2019-12-07 16:32:16,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220082 states. [2019-12-07 16:32:17,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220082 states to 220082 states and 955428 transitions. [2019-12-07 16:32:17,650 INFO L78 Accepts]: Start accepts. Automaton has 220082 states and 955428 transitions. Word has length 19 [2019-12-07 16:32:17,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:32:17,650 INFO L462 AbstractCegarLoop]: Abstraction has 220082 states and 955428 transitions. [2019-12-07 16:32:17,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:32:17,650 INFO L276 IsEmpty]: Start isEmpty. Operand 220082 states and 955428 transitions. [2019-12-07 16:32:17,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 16:32:17,664 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:32:17,664 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:32:17,664 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:32:17,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:32:17,665 INFO L82 PathProgramCache]: Analyzing trace with hash -993922956, now seen corresponding path program 1 times [2019-12-07 16:32:17,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:32:17,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095743653] [2019-12-07 16:32:17,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:32:17,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:32:17,708 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 16:32:17,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095743653] [2019-12-07 16:32:17,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:32:17,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 16:32:17,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435157647] [2019-12-07 16:32:17,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:32:17,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:32:17,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:32:17,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:32:17,709 INFO L87 Difference]: Start difference. First operand 220082 states and 955428 transitions. Second operand 3 states. [2019-12-07 16:32:19,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:32:19,243 INFO L93 Difference]: Finished difference Result 208030 states and 902200 transitions. [2019-12-07 16:32:19,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:32:19,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 16:32:19,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:32:19,817 INFO L225 Difference]: With dead ends: 208030 [2019-12-07 16:32:19,817 INFO L226 Difference]: Without dead ends: 208030 [2019-12-07 16:32:19,818 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:32:21,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208030 states. [2019-12-07 16:32:27,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208030 to 208030. [2019-12-07 16:32:27,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208030 states. [2019-12-07 16:32:28,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208030 states to 208030 states and 902200 transitions. [2019-12-07 16:32:28,356 INFO L78 Accepts]: Start accepts. Automaton has 208030 states and 902200 transitions. Word has length 20 [2019-12-07 16:32:28,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:32:28,356 INFO L462 AbstractCegarLoop]: Abstraction has 208030 states and 902200 transitions. [2019-12-07 16:32:28,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:32:28,356 INFO L276 IsEmpty]: Start isEmpty. Operand 208030 states and 902200 transitions. [2019-12-07 16:32:28,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 16:32:28,373 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:32:28,373 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:32:28,374 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:32:28,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:32:28,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1950965462, now seen corresponding path program 1 times [2019-12-07 16:32:28,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:32:28,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430197173] [2019-12-07 16:32:28,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:32:28,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:32:28,422 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 16:32:28,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430197173] [2019-12-07 16:32:28,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:32:28,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:32:28,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163576059] [2019-12-07 16:32:28,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:32:28,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:32:28,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:32:28,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:32:28,424 INFO L87 Difference]: Start difference. First operand 208030 states and 902200 transitions. Second operand 4 states. [2019-12-07 16:32:30,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:32:30,289 INFO L93 Difference]: Finished difference Result 258726 states and 1108448 transitions. [2019-12-07 16:32:30,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:32:30,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 16:32:30,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:32:31,036 INFO L225 Difference]: With dead ends: 258726 [2019-12-07 16:32:31,036 INFO L226 Difference]: Without dead ends: 258658 [2019-12-07 16:32:31,037 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 16:32:33,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258658 states. [2019-12-07 16:32:40,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258658 to 211214. [2019-12-07 16:32:40,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211214 states. [2019-12-07 16:32:40,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211214 states to 211214 states and 915696 transitions. [2019-12-07 16:32:40,850 INFO L78 Accepts]: Start accepts. Automaton has 211214 states and 915696 transitions. Word has length 21 [2019-12-07 16:32:40,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:32:40,850 INFO L462 AbstractCegarLoop]: Abstraction has 211214 states and 915696 transitions. [2019-12-07 16:32:40,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:32:40,850 INFO L276 IsEmpty]: Start isEmpty. Operand 211214 states and 915696 transitions. [2019-12-07 16:32:40,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 16:32:40,890 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:32:40,890 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] [2019-12-07 16:32:40,890 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:32:40,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:32:40,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1910405908, now seen corresponding path program 1 times [2019-12-07 16:32:40,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:32:40,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370511427] [2019-12-07 16:32:40,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:32:40,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:32:40,928 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 16:32:40,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370511427] [2019-12-07 16:32:40,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:32:40,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:32:40,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183769026] [2019-12-07 16:32:40,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:32:40,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:32:40,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:32:40,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:32:40,930 INFO L87 Difference]: Start difference. First operand 211214 states and 915696 transitions. Second operand 5 states. [2019-12-07 16:32:43,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:32:43,217 INFO L93 Difference]: Finished difference Result 296514 states and 1260128 transitions. [2019-12-07 16:32:43,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 16:32:43,218 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-07 16:32:43,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:32:44,104 INFO L225 Difference]: With dead ends: 296514 [2019-12-07 16:32:44,104 INFO L226 Difference]: Without dead ends: 296458 [2019-12-07 16:32:44,104 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 16:32:47,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296458 states. [2019-12-07 16:32:51,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296458 to 230654. [2019-12-07 16:32:51,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230654 states. [2019-12-07 16:32:51,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230654 states to 230654 states and 995852 transitions. [2019-12-07 16:32:51,967 INFO L78 Accepts]: Start accepts. Automaton has 230654 states and 995852 transitions. Word has length 24 [2019-12-07 16:32:51,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:32:51,967 INFO L462 AbstractCegarLoop]: Abstraction has 230654 states and 995852 transitions. [2019-12-07 16:32:51,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:32:51,967 INFO L276 IsEmpty]: Start isEmpty. Operand 230654 states and 995852 transitions. [2019-12-07 16:32:52,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 16:32:52,042 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:32:52,043 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] [2019-12-07 16:32:52,043 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:32:52,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:32:52,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1719472782, now seen corresponding path program 1 times [2019-12-07 16:32:52,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:32:52,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732787865] [2019-12-07 16:32:52,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:32:52,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:32:52,084 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 16:32:52,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732787865] [2019-12-07 16:32:52,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:32:52,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:32:52,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070757910] [2019-12-07 16:32:52,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:32:52,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:32:52,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:32:52,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:32:52,085 INFO L87 Difference]: Start difference. First operand 230654 states and 995852 transitions. Second operand 5 states. [2019-12-07 16:32:54,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:32:54,467 INFO L93 Difference]: Finished difference Result 306554 states and 1302104 transitions. [2019-12-07 16:32:54,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 16:32:54,468 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 16:32:54,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:32:55,360 INFO L225 Difference]: With dead ends: 306554 [2019-12-07 16:32:55,360 INFO L226 Difference]: Without dead ends: 306442 [2019-12-07 16:32:55,360 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 16:33:01,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306442 states. [2019-12-07 16:33:04,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306442 to 215150. [2019-12-07 16:33:04,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215150 states. [2019-12-07 16:33:05,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215150 states to 215150 states and 930748 transitions. [2019-12-07 16:33:05,384 INFO L78 Accepts]: Start accepts. Automaton has 215150 states and 930748 transitions. Word has length 27 [2019-12-07 16:33:05,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:33:05,385 INFO L462 AbstractCegarLoop]: Abstraction has 215150 states and 930748 transitions. [2019-12-07 16:33:05,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:33:05,385 INFO L276 IsEmpty]: Start isEmpty. Operand 215150 states and 930748 transitions. [2019-12-07 16:33:05,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 16:33:05,584 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:33:05,584 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:33:05,584 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:33:05,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:33:05,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1681941858, now seen corresponding path program 1 times [2019-12-07 16:33:05,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:33:05,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003037159] [2019-12-07 16:33:05,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:33:05,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:33:05,637 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 16:33:05,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003037159] [2019-12-07 16:33:05,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:33:05,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:33:05,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199370031] [2019-12-07 16:33:05,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:33:05,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:33:05,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:33:05,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:33:05,639 INFO L87 Difference]: Start difference. First operand 215150 states and 930748 transitions. Second operand 4 states. [2019-12-07 16:33:07,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:33:07,533 INFO L93 Difference]: Finished difference Result 321862 states and 1336102 transitions. [2019-12-07 16:33:07,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:33:07,534 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-12-07 16:33:07,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:33:08,406 INFO L225 Difference]: With dead ends: 321862 [2019-12-07 16:33:08,406 INFO L226 Difference]: Without dead ends: 321328 [2019-12-07 16:33:08,406 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:33:11,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321328 states. [2019-12-07 16:33:15,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321328 to 245804. [2019-12-07 16:33:15,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245804 states. [2019-12-07 16:33:16,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245804 states to 245804 states and 1043952 transitions. [2019-12-07 16:33:16,545 INFO L78 Accepts]: Start accepts. Automaton has 245804 states and 1043952 transitions. Word has length 34 [2019-12-07 16:33:16,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:33:16,545 INFO L462 AbstractCegarLoop]: Abstraction has 245804 states and 1043952 transitions. [2019-12-07 16:33:16,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:33:16,545 INFO L276 IsEmpty]: Start isEmpty. Operand 245804 states and 1043952 transitions. [2019-12-07 16:33:16,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 16:33:16,755 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:33:16,755 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:33:16,755 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:33:16,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:33:16,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1626509605, now seen corresponding path program 1 times [2019-12-07 16:33:16,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:33:16,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787336819] [2019-12-07 16:33:16,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:33:16,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:33:16,814 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 16:33:16,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787336819] [2019-12-07 16:33:16,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:33:16,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:33:16,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496275033] [2019-12-07 16:33:16,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:33:16,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:33:16,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:33:16,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:33:16,816 INFO L87 Difference]: Start difference. First operand 245804 states and 1043952 transitions. Second operand 4 states. [2019-12-07 16:33:18,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:33:18,818 INFO L93 Difference]: Finished difference Result 351240 states and 1445134 transitions. [2019-12-07 16:33:18,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:33:18,818 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-12-07 16:33:18,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:33:19,434 INFO L225 Difference]: With dead ends: 351240 [2019-12-07 16:33:19,434 INFO L226 Difference]: Without dead ends: 218186 [2019-12-07 16:33:19,434 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 16:33:24,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218186 states. [2019-12-07 16:33:27,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218186 to 215046. [2019-12-07 16:33:27,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215046 states. [2019-12-07 16:33:28,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215046 states to 215046 states and 827468 transitions. [2019-12-07 16:33:28,473 INFO L78 Accepts]: Start accepts. Automaton has 215046 states and 827468 transitions. Word has length 35 [2019-12-07 16:33:28,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:33:28,473 INFO L462 AbstractCegarLoop]: Abstraction has 215046 states and 827468 transitions. [2019-12-07 16:33:28,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:33:28,473 INFO L276 IsEmpty]: Start isEmpty. Operand 215046 states and 827468 transitions. [2019-12-07 16:33:28,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 16:33:28,662 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:33:28,662 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:33:28,662 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:33:28,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:33:28,663 INFO L82 PathProgramCache]: Analyzing trace with hash -678253624, now seen corresponding path program 1 times [2019-12-07 16:33:28,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:33:28,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890764868] [2019-12-07 16:33:28,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:33:28,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:33:28,704 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 16:33:28,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890764868] [2019-12-07 16:33:28,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:33:28,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:33:28,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828552736] [2019-12-07 16:33:28,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:33:28,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:33:28,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:33:28,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:33:28,705 INFO L87 Difference]: Start difference. First operand 215046 states and 827468 transitions. Second operand 3 states. [2019-12-07 16:33:29,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:33:29,609 INFO L93 Difference]: Finished difference Result 202290 states and 767650 transitions. [2019-12-07 16:33:29,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:33:29,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-12-07 16:33:29,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:33:30,113 INFO L225 Difference]: With dead ends: 202290 [2019-12-07 16:33:30,113 INFO L226 Difference]: Without dead ends: 202290 [2019-12-07 16:33:30,113 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 16:33:32,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202290 states. [2019-12-07 16:33:34,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202290 to 201170. [2019-12-07 16:33:34,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201170 states. [2019-12-07 16:33:35,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201170 states to 201170 states and 763842 transitions. [2019-12-07 16:33:35,546 INFO L78 Accepts]: Start accepts. Automaton has 201170 states and 763842 transitions. Word has length 35 [2019-12-07 16:33:35,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:33:35,547 INFO L462 AbstractCegarLoop]: Abstraction has 201170 states and 763842 transitions. [2019-12-07 16:33:35,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:33:35,547 INFO L276 IsEmpty]: Start isEmpty. Operand 201170 states and 763842 transitions. [2019-12-07 16:33:35,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 16:33:35,732 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:33:35,732 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:33:35,732 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:33:35,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:33:35,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1312475915, now seen corresponding path program 1 times [2019-12-07 16:33:35,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:33:35,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441366558] [2019-12-07 16:33:35,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:33:35,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:33:35,836 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 16:33:35,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441366558] [2019-12-07 16:33:35,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:33:35,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 16:33:35,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353050692] [2019-12-07 16:33:35,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 16:33:35,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:33:35,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 16:33:35,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-07 16:33:35,837 INFO L87 Difference]: Start difference. First operand 201170 states and 763842 transitions. Second operand 9 states. [2019-12-07 16:33:38,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:33:38,468 INFO L93 Difference]: Finished difference Result 395326 states and 1514216 transitions. [2019-12-07 16:33:38,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 16:33:38,469 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2019-12-07 16:33:38,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:33:39,533 INFO L225 Difference]: With dead ends: 395326 [2019-12-07 16:33:39,533 INFO L226 Difference]: Without dead ends: 395326 [2019-12-07 16:33:39,534 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=184, Invalid=466, Unknown=0, NotChecked=0, Total=650 [2019-12-07 16:33:42,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395326 states. [2019-12-07 16:33:48,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395326 to 284526. [2019-12-07 16:33:48,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284526 states. [2019-12-07 16:33:49,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284526 states to 284526 states and 1096530 transitions. [2019-12-07 16:33:49,229 INFO L78 Accepts]: Start accepts. Automaton has 284526 states and 1096530 transitions. Word has length 36 [2019-12-07 16:33:49,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:33:49,229 INFO L462 AbstractCegarLoop]: Abstraction has 284526 states and 1096530 transitions. [2019-12-07 16:33:49,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 16:33:49,229 INFO L276 IsEmpty]: Start isEmpty. Operand 284526 states and 1096530 transitions. [2019-12-07 16:33:49,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 16:33:49,507 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:33:49,507 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:33:49,507 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:33:49,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:33:49,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1481629199, now seen corresponding path program 2 times [2019-12-07 16:33:49,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:33:49,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26852598] [2019-12-07 16:33:49,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:33:49,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:33:49,615 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 16:33:49,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26852598] [2019-12-07 16:33:49,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:33:49,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 16:33:49,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133588029] [2019-12-07 16:33:49,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 16:33:49,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:33:49,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 16:33:49,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-07 16:33:49,616 INFO L87 Difference]: Start difference. First operand 284526 states and 1096530 transitions. Second operand 9 states. [2019-12-07 16:33:55,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:33:55,108 INFO L93 Difference]: Finished difference Result 407164 states and 1571663 transitions. [2019-12-07 16:33:55,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-07 16:33:55,108 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2019-12-07 16:33:55,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:33:56,193 INFO L225 Difference]: With dead ends: 407164 [2019-12-07 16:33:56,193 INFO L226 Difference]: Without dead ends: 407164 [2019-12-07 16:33:56,194 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=195, Invalid=561, Unknown=0, NotChecked=0, Total=756 [2019-12-07 16:33:59,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407164 states. [2019-12-07 16:34:03,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407164 to 289374. [2019-12-07 16:34:03,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289374 states. [2019-12-07 16:34:04,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289374 states to 289374 states and 1116338 transitions. [2019-12-07 16:34:04,530 INFO L78 Accepts]: Start accepts. Automaton has 289374 states and 1116338 transitions. Word has length 36 [2019-12-07 16:34:04,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:34:04,530 INFO L462 AbstractCegarLoop]: Abstraction has 289374 states and 1116338 transitions. [2019-12-07 16:34:04,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 16:34:04,530 INFO L276 IsEmpty]: Start isEmpty. Operand 289374 states and 1116338 transitions. [2019-12-07 16:34:05,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 16:34:05,245 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:34:05,245 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:34:05,245 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:34:05,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:34:05,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1306870711, now seen corresponding path program 3 times [2019-12-07 16:34:05,245 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:34:05,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060679738] [2019-12-07 16:34:05,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:34:05,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:34:05,366 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 16:34:05,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060679738] [2019-12-07 16:34:05,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:34:05,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 16:34:05,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570040826] [2019-12-07 16:34:05,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 16:34:05,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:34:05,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 16:34:05,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-07 16:34:05,367 INFO L87 Difference]: Start difference. First operand 289374 states and 1116338 transitions. Second operand 10 states. [2019-12-07 16:34:08,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:34:08,865 INFO L93 Difference]: Finished difference Result 450158 states and 1719714 transitions. [2019-12-07 16:34:08,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-07 16:34:08,866 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2019-12-07 16:34:08,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:34:10,037 INFO L225 Difference]: With dead ends: 450158 [2019-12-07 16:34:10,037 INFO L226 Difference]: Without dead ends: 450158 [2019-12-07 16:34:10,038 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=225, Invalid=705, Unknown=0, NotChecked=0, Total=930 [2019-12-07 16:34:13,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450158 states. [2019-12-07 16:34:18,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450158 to 343278. [2019-12-07 16:34:18,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343278 states. [2019-12-07 16:34:20,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343278 states to 343278 states and 1314762 transitions. [2019-12-07 16:34:20,070 INFO L78 Accepts]: Start accepts. Automaton has 343278 states and 1314762 transitions. Word has length 36 [2019-12-07 16:34:20,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:34:20,070 INFO L462 AbstractCegarLoop]: Abstraction has 343278 states and 1314762 transitions. [2019-12-07 16:34:20,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 16:34:20,070 INFO L276 IsEmpty]: Start isEmpty. Operand 343278 states and 1314762 transitions. [2019-12-07 16:34:20,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 16:34:20,454 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:34:20,454 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:34:20,454 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:34:20,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:34:20,455 INFO L82 PathProgramCache]: Analyzing trace with hash -439679343, now seen corresponding path program 4 times [2019-12-07 16:34:20,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:34:20,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676099604] [2019-12-07 16:34:20,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:34:20,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:34:20,571 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 16:34:20,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676099604] [2019-12-07 16:34:20,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:34:20,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 16:34:20,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915272943] [2019-12-07 16:34:20,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 16:34:20,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:34:20,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 16:34:20,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-07 16:34:20,572 INFO L87 Difference]: Start difference. First operand 343278 states and 1314762 transitions. Second operand 11 states. [2019-12-07 16:34:26,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:34:26,873 INFO L93 Difference]: Finished difference Result 558236 states and 2135943 transitions. [2019-12-07 16:34:26,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 16:34:26,873 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2019-12-07 16:34:26,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:34:28,445 INFO L225 Difference]: With dead ends: 558236 [2019-12-07 16:34:28,446 INFO L226 Difference]: Without dead ends: 468104 [2019-12-07 16:34:28,446 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=194, Invalid=508, Unknown=0, NotChecked=0, Total=702 [2019-12-07 16:34:31,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468104 states. [2019-12-07 16:34:38,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468104 to 398430. [2019-12-07 16:34:38,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398430 states. [2019-12-07 16:34:39,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398430 states to 398430 states and 1531050 transitions. [2019-12-07 16:34:39,773 INFO L78 Accepts]: Start accepts. Automaton has 398430 states and 1531050 transitions. Word has length 36 [2019-12-07 16:34:39,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:34:39,773 INFO L462 AbstractCegarLoop]: Abstraction has 398430 states and 1531050 transitions. [2019-12-07 16:34:39,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 16:34:39,773 INFO L276 IsEmpty]: Start isEmpty. Operand 398430 states and 1531050 transitions. [2019-12-07 16:34:40,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 16:34:40,210 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:34:40,210 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:34:40,211 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:34:40,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:34:40,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1923147327, now seen corresponding path program 5 times [2019-12-07 16:34:40,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:34:40,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149336328] [2019-12-07 16:34:40,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:34:40,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:34:40,277 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 16:34:40,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149336328] [2019-12-07 16:34:40,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:34:40,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:34:40,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304386820] [2019-12-07 16:34:40,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:34:40,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:34:40,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:34:40,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:34:40,278 INFO L87 Difference]: Start difference. First operand 398430 states and 1531050 transitions. Second operand 6 states. [2019-12-07 16:34:43,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:34:43,062 INFO L93 Difference]: Finished difference Result 494792 states and 1895891 transitions. [2019-12-07 16:34:43,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 16:34:43,063 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-12-07 16:34:43,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:34:45,036 INFO L225 Difference]: With dead ends: 494792 [2019-12-07 16:34:45,036 INFO L226 Difference]: Without dead ends: 469704 [2019-12-07 16:34:45,036 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-07 16:34:48,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469704 states. [2019-12-07 16:34:58,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469704 to 391470. [2019-12-07 16:34:58,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391470 states. [2019-12-07 16:35:00,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391470 states to 391470 states and 1502202 transitions. [2019-12-07 16:35:00,147 INFO L78 Accepts]: Start accepts. Automaton has 391470 states and 1502202 transitions. Word has length 36 [2019-12-07 16:35:00,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:35:00,148 INFO L462 AbstractCegarLoop]: Abstraction has 391470 states and 1502202 transitions. [2019-12-07 16:35:00,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:35:00,148 INFO L276 IsEmpty]: Start isEmpty. Operand 391470 states and 1502202 transitions. [2019-12-07 16:35:00,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 16:35:00,589 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:35:00,589 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:35:00,589 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:35:00,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:35:00,590 INFO L82 PathProgramCache]: Analyzing trace with hash 509105165, now seen corresponding path program 6 times [2019-12-07 16:35:00,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:35:00,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789210062] [2019-12-07 16:35:00,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:35:00,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:35:00,654 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 16:35:00,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789210062] [2019-12-07 16:35:00,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:35:00,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 16:35:00,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385331856] [2019-12-07 16:35:00,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 16:35:00,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:35:00,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 16:35:00,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:35:00,655 INFO L87 Difference]: Start difference. First operand 391470 states and 1502202 transitions. Second operand 8 states. [2019-12-07 16:35:04,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:35:04,388 INFO L93 Difference]: Finished difference Result 642502 states and 2455658 transitions. [2019-12-07 16:35:04,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 16:35:04,389 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2019-12-07 16:35:04,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:35:06,409 INFO L225 Difference]: With dead ends: 642502 [2019-12-07 16:35:06,409 INFO L226 Difference]: Without dead ends: 578142 [2019-12-07 16:35:06,410 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2019-12-07 16:35:10,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578142 states. [2019-12-07 16:35:16,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578142 to 372426. [2019-12-07 16:35:16,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372426 states. [2019-12-07 16:35:18,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372426 states to 372426 states and 1426214 transitions. [2019-12-07 16:35:18,024 INFO L78 Accepts]: Start accepts. Automaton has 372426 states and 1426214 transitions. Word has length 36 [2019-12-07 16:35:18,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:35:18,024 INFO L462 AbstractCegarLoop]: Abstraction has 372426 states and 1426214 transitions. [2019-12-07 16:35:18,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 16:35:18,024 INFO L276 IsEmpty]: Start isEmpty. Operand 372426 states and 1426214 transitions. [2019-12-07 16:35:18,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 16:35:18,457 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:35:18,458 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:35:18,458 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:35:18,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:35:18,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1003857378, now seen corresponding path program 1 times [2019-12-07 16:35:18,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:35:18,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765101645] [2019-12-07 16:35:18,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:35:18,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:35:18,502 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 16:35:18,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765101645] [2019-12-07 16:35:18,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:35:18,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:35:18,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546767447] [2019-12-07 16:35:18,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:35:18,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:35:18,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:35:18,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:35:18,503 INFO L87 Difference]: Start difference. First operand 372426 states and 1426214 transitions. Second operand 4 states. [2019-12-07 16:35:22,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:35:22,966 INFO L93 Difference]: Finished difference Result 306689 states and 1110099 transitions. [2019-12-07 16:35:22,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:35:22,967 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-12-07 16:35:22,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:35:23,605 INFO L225 Difference]: With dead ends: 306689 [2019-12-07 16:35:23,605 INFO L226 Difference]: Without dead ends: 286909 [2019-12-07 16:35:23,605 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 16:35:25,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286909 states. [2019-12-07 16:35:29,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286909 to 286909. [2019-12-07 16:35:29,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286909 states. [2019-12-07 16:35:30,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286909 states to 286909 states and 1047318 transitions. [2019-12-07 16:35:30,101 INFO L78 Accepts]: Start accepts. Automaton has 286909 states and 1047318 transitions. Word has length 37 [2019-12-07 16:35:30,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:35:30,101 INFO L462 AbstractCegarLoop]: Abstraction has 286909 states and 1047318 transitions. [2019-12-07 16:35:30,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:35:30,101 INFO L276 IsEmpty]: Start isEmpty. Operand 286909 states and 1047318 transitions. [2019-12-07 16:35:30,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 16:35:30,799 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:35:30,799 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] [2019-12-07 16:35:30,799 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:35:30,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:35:30,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1186758008, now seen corresponding path program 1 times [2019-12-07 16:35:30,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:35:30,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013122127] [2019-12-07 16:35:30,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:35:30,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:35:30,851 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 16:35:30,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013122127] [2019-12-07 16:35:30,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:35:30,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:35:30,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881877493] [2019-12-07 16:35:30,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:35:30,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:35:30,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:35:30,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:35:30,852 INFO L87 Difference]: Start difference. First operand 286909 states and 1047318 transitions. Second operand 5 states. [2019-12-07 16:35:31,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:35:31,322 INFO L93 Difference]: Finished difference Result 128377 states and 420670 transitions. [2019-12-07 16:35:31,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:35:31,322 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-12-07 16:35:31,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:35:31,526 INFO L225 Difference]: With dead ends: 128377 [2019-12-07 16:35:31,526 INFO L226 Difference]: Without dead ends: 113314 [2019-12-07 16:35:31,527 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 16:35:32,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113314 states. [2019-12-07 16:35:33,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113314 to 112620. [2019-12-07 16:35:33,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112620 states. [2019-12-07 16:35:34,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112620 states to 112620 states and 367443 transitions. [2019-12-07 16:35:34,042 INFO L78 Accepts]: Start accepts. Automaton has 112620 states and 367443 transitions. Word has length 38 [2019-12-07 16:35:34,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:35:34,042 INFO L462 AbstractCegarLoop]: Abstraction has 112620 states and 367443 transitions. [2019-12-07 16:35:34,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:35:34,042 INFO L276 IsEmpty]: Start isEmpty. Operand 112620 states and 367443 transitions. [2019-12-07 16:35:34,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 16:35:34,133 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:35:34,133 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:35:34,133 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:35:34,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:35:34,133 INFO L82 PathProgramCache]: Analyzing trace with hash 198649775, now seen corresponding path program 1 times [2019-12-07 16:35:34,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:35:34,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792764788] [2019-12-07 16:35:34,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:35:34,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:35:34,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:35:34,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792764788] [2019-12-07 16:35:34,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:35:34,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 16:35:34,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375099450] [2019-12-07 16:35:34,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:35:34,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:35:34,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:35:34,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:35:34,188 INFO L87 Difference]: Start difference. First operand 112620 states and 367443 transitions. Second operand 6 states. [2019-12-07 16:35:34,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:35:34,301 INFO L93 Difference]: Finished difference Result 27371 states and 80615 transitions. [2019-12-07 16:35:34,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:35:34,302 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-12-07 16:35:34,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:35:34,330 INFO L225 Difference]: With dead ends: 27371 [2019-12-07 16:35:34,330 INFO L226 Difference]: Without dead ends: 21897 [2019-12-07 16:35:34,331 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 16:35:34,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21897 states. [2019-12-07 16:35:34,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21897 to 20915. [2019-12-07 16:35:34,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20915 states. [2019-12-07 16:35:34,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20915 states to 20915 states and 59775 transitions. [2019-12-07 16:35:34,593 INFO L78 Accepts]: Start accepts. Automaton has 20915 states and 59775 transitions. Word has length 39 [2019-12-07 16:35:34,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:35:34,593 INFO L462 AbstractCegarLoop]: Abstraction has 20915 states and 59775 transitions. [2019-12-07 16:35:34,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:35:34,594 INFO L276 IsEmpty]: Start isEmpty. Operand 20915 states and 59775 transitions. [2019-12-07 16:35:34,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 16:35:34,611 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:35:34,611 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] [2019-12-07 16:35:34,611 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:35:34,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:35:34,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1535210011, now seen corresponding path program 1 times [2019-12-07 16:35:34,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:35:34,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232016958] [2019-12-07 16:35:34,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:35:34,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:35:34,642 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 16:35:34,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232016958] [2019-12-07 16:35:34,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:35:34,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:35:34,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807477230] [2019-12-07 16:35:34,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:35:34,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:35:34,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:35:34,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:35:34,643 INFO L87 Difference]: Start difference. First operand 20915 states and 59775 transitions. Second operand 4 states. [2019-12-07 16:35:34,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:35:34,699 INFO L93 Difference]: Finished difference Result 23389 states and 65345 transitions. [2019-12-07 16:35:34,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:35:34,699 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-12-07 16:35:34,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:35:34,717 INFO L225 Difference]: With dead ends: 23389 [2019-12-07 16:35:34,717 INFO L226 Difference]: Without dead ends: 16833 [2019-12-07 16:35:34,718 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 16:35:34,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16833 states. [2019-12-07 16:35:34,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16833 to 16813. [2019-12-07 16:35:34,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16813 states. [2019-12-07 16:35:34,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16813 states to 16813 states and 45855 transitions. [2019-12-07 16:35:34,916 INFO L78 Accepts]: Start accepts. Automaton has 16813 states and 45855 transitions. Word has length 50 [2019-12-07 16:35:34,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:35:34,916 INFO L462 AbstractCegarLoop]: Abstraction has 16813 states and 45855 transitions. [2019-12-07 16:35:34,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:35:34,916 INFO L276 IsEmpty]: Start isEmpty. Operand 16813 states and 45855 transitions. [2019-12-07 16:35:34,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 16:35:34,930 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:35:34,930 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] [2019-12-07 16:35:34,930 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:35:34,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:35:34,931 INFO L82 PathProgramCache]: Analyzing trace with hash 775370005, now seen corresponding path program 2 times [2019-12-07 16:35:34,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:35:34,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409646751] [2019-12-07 16:35:34,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:35:34,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:35:34,980 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 16:35:34,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409646751] [2019-12-07 16:35:34,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:35:34,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 16:35:34,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583593809] [2019-12-07 16:35:34,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 16:35:34,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:35:34,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 16:35:34,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:35:34,981 INFO L87 Difference]: Start difference. First operand 16813 states and 45855 transitions. Second operand 7 states. [2019-12-07 16:35:35,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:35:35,072 INFO L93 Difference]: Finished difference Result 14823 states and 41384 transitions. [2019-12-07 16:35:35,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 16:35:35,073 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-12-07 16:35:35,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:35:35,079 INFO L225 Difference]: With dead ends: 14823 [2019-12-07 16:35:35,079 INFO L226 Difference]: Without dead ends: 5523 [2019-12-07 16:35:35,079 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-07 16:35:35,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5523 states. [2019-12-07 16:35:35,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5523 to 5395. [2019-12-07 16:35:35,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5395 states. [2019-12-07 16:35:35,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5395 states to 5395 states and 13802 transitions. [2019-12-07 16:35:35,133 INFO L78 Accepts]: Start accepts. Automaton has 5395 states and 13802 transitions. Word has length 50 [2019-12-07 16:35:35,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:35:35,134 INFO L462 AbstractCegarLoop]: Abstraction has 5395 states and 13802 transitions. [2019-12-07 16:35:35,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 16:35:35,134 INFO L276 IsEmpty]: Start isEmpty. Operand 5395 states and 13802 transitions. [2019-12-07 16:35:35,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 16:35:35,137 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:35:35,137 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:35:35,137 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:35:35,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:35:35,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1100404435, now seen corresponding path program 1 times [2019-12-07 16:35:35,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:35:35,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024755883] [2019-12-07 16:35:35,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:35:35,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:35:35,196 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 16:35:35,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024755883] [2019-12-07 16:35:35,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:35:35,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:35:35,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225898442] [2019-12-07 16:35:35,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:35:35,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:35:35,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:35:35,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:35:35,197 INFO L87 Difference]: Start difference. First operand 5395 states and 13802 transitions. Second operand 4 states. [2019-12-07 16:35:35,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:35:35,235 INFO L93 Difference]: Finished difference Result 5884 states and 14900 transitions. [2019-12-07 16:35:35,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:35:35,235 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-07 16:35:35,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:35:35,238 INFO L225 Difference]: With dead ends: 5884 [2019-12-07 16:35:35,238 INFO L226 Difference]: Without dead ends: 4351 [2019-12-07 16:35:35,239 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 16:35:35,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4351 states. [2019-12-07 16:35:35,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4351 to 3909. [2019-12-07 16:35:35,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3909 states. [2019-12-07 16:35:35,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3909 states to 3909 states and 10083 transitions. [2019-12-07 16:35:35,277 INFO L78 Accepts]: Start accepts. Automaton has 3909 states and 10083 transitions. Word has length 65 [2019-12-07 16:35:35,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:35:35,277 INFO L462 AbstractCegarLoop]: Abstraction has 3909 states and 10083 transitions. [2019-12-07 16:35:35,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:35:35,277 INFO L276 IsEmpty]: Start isEmpty. Operand 3909 states and 10083 transitions. [2019-12-07 16:35:35,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 16:35:35,280 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:35:35,280 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:35:35,280 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:35:35,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:35:35,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1891696283, now seen corresponding path program 2 times [2019-12-07 16:35:35,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:35:35,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973884796] [2019-12-07 16:35:35,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:35:35,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:35:35,345 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 16:35:35,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973884796] [2019-12-07 16:35:35,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:35:35,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:35:35,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25239196] [2019-12-07 16:35:35,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:35:35,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:35:35,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:35:35,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:35:35,347 INFO L87 Difference]: Start difference. First operand 3909 states and 10083 transitions. Second operand 5 states. [2019-12-07 16:35:35,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:35:35,392 INFO L93 Difference]: Finished difference Result 4406 states and 11198 transitions. [2019-12-07 16:35:35,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:35:35,392 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-07 16:35:35,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:35:35,393 INFO L225 Difference]: With dead ends: 4406 [2019-12-07 16:35:35,393 INFO L226 Difference]: Without dead ends: 555 [2019-12-07 16:35:35,393 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:35:35,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-12-07 16:35:35,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2019-12-07 16:35:35,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-12-07 16:35:35,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 1183 transitions. [2019-12-07 16:35:35,398 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 1183 transitions. Word has length 65 [2019-12-07 16:35:35,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:35:35,398 INFO L462 AbstractCegarLoop]: Abstraction has 555 states and 1183 transitions. [2019-12-07 16:35:35,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:35:35,398 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 1183 transitions. [2019-12-07 16:35:35,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 16:35:35,399 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:35:35,399 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:35:35,399 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:35:35,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:35:35,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1960507102, now seen corresponding path program 1 times [2019-12-07 16:35:35,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:35:35,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686135677] [2019-12-07 16:35:35,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:35:35,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:35:35,472 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 16:35:35,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686135677] [2019-12-07 16:35:35,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:35:35,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 16:35:35,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202665128] [2019-12-07 16:35:35,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 16:35:35,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:35:35,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 16:35:35,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:35:35,473 INFO L87 Difference]: Start difference. First operand 555 states and 1183 transitions. Second operand 7 states. [2019-12-07 16:35:35,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:35:35,633 INFO L93 Difference]: Finished difference Result 1169 states and 2456 transitions. [2019-12-07 16:35:35,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 16:35:35,633 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-07 16:35:35,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:35:35,634 INFO L225 Difference]: With dead ends: 1169 [2019-12-07 16:35:35,634 INFO L226 Difference]: Without dead ends: 854 [2019-12-07 16:35:35,634 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-07 16:35:35,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2019-12-07 16:35:35,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 638. [2019-12-07 16:35:35,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2019-12-07 16:35:35,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 1324 transitions. [2019-12-07 16:35:35,640 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 1324 transitions. Word has length 66 [2019-12-07 16:35:35,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:35:35,640 INFO L462 AbstractCegarLoop]: Abstraction has 638 states and 1324 transitions. [2019-12-07 16:35:35,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 16:35:35,640 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 1324 transitions. [2019-12-07 16:35:35,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 16:35:35,641 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:35:35,641 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:35:35,641 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:35:35,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:35:35,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1469521026, now seen corresponding path program 2 times [2019-12-07 16:35:35,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:35:35,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991759056] [2019-12-07 16:35:35,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:35:35,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:35:35,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:35:35,733 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 16:35:35,733 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 16:35:35,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1061] [1061] ULTIMATE.startENTRY-->L851: Formula: (let ((.cse0 (store |v_#valid_85| 0 0))) (and (= v_~__unbuffered_cnt~0_140 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t549~0.base_34|)) (= v_~z$r_buff0_thd2~0_131 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t549~0.base_34| 1) |v_#valid_83|) (= (store |v_#length_28| |v_ULTIMATE.start_main_~#t549~0.base_34| 4) |v_#length_27|) (= 0 v_~z$flush_delayed~0_223) (= 0 v_~__unbuffered_p3_EAX~0_84) (= |v_#NULL.offset_6| 0) (= v_~z$w_buff1~0_366 0) (= v_~z$r_buff0_thd0~0_214 0) (= v_~z$r_buff1_thd2~0_149 0) (= v_~z$read_delayed~0_8 0) (= v_~z$r_buff1_thd1~0_149 0) (= v_~z$read_delayed_var~0.base_8 0) (= v_~main$tmp_guard1~0_56 0) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t549~0.base_34|) (= v_~z$r_buff0_thd1~0_132 0) (= 0 v_~z$r_buff1_thd4~0_351) (= v_~a~0_48 0) (= 0 v_~z$mem_tmp~0_195) (= 0 |v_#NULL.base_6|) (= v_~z$w_buff1_used~0_712 0) (= v_~z$r_buff1_thd0~0_223 0) (= 0 v_~__unbuffered_p2_EAX~0_71) (< 0 |v_#StackHeapBarrier_20|) (= v_~z$w_buff0~0_640 0) (= v_~main$tmp_guard0~0_47 0) (= 0 v_~__unbuffered_p3_EBX~0_61) (= v_~y~0_94 0) (= 0 v_~z$r_buff0_thd3~0_453) (= v_~z$w_buff0_used~0_1093 0) (= 0 |v_ULTIMATE.start_main_~#t549~0.offset_23|) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t549~0.base_34| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t549~0.base_34|) |v_ULTIMATE.start_main_~#t549~0.offset_23| 0)) |v_#memory_int_25|) (= v_~weak$$choice2~0_273 0) (= 0 v_~weak$$choice0~0_182) (= 0 v_~z$r_buff0_thd4~0_575) (= v_~z~0_310 0) (= 0 v_~__unbuffered_p0_EAX~0_80) (= 0 v_~z$r_buff1_thd3~0_381) (= v_~z$read_delayed_var~0.offset_8 0) (= v_~x~0_47 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_85|, #memory_int=|v_#memory_int_26|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_7|, ULTIMATE.start_main_~#t551~0.offset=|v_ULTIMATE.start_main_~#t551~0.offset_17|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_7|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_149, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t552~0.base=|v_ULTIMATE.start_main_~#t552~0.base_22|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_111|, ULTIMATE.start_main_~#t549~0.offset=|v_ULTIMATE.start_main_~#t549~0.offset_23|, ~a~0=v_~a~0_48, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_214, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_80, ULTIMATE.start_main_~#t549~0.base=|v_ULTIMATE.start_main_~#t549~0.base_34|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_575, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_84, #length=|v_#length_27|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_71, ULTIMATE.start_main_~#t551~0.base=|v_ULTIMATE.start_main_~#t551~0.base_28|, ~z$mem_tmp~0=v_~z$mem_tmp~0_195, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_712, ~z$flush_delayed~0=v_~z$flush_delayed~0_223, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_43|, ~weak$$choice0~0=v_~weak$$choice0~0_182, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_183|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_149, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_453, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_140, ~x~0=v_~x~0_47, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_351, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_24|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_7|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_366, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_56, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ULTIMATE.start_main_~#t550~0.offset=|v_ULTIMATE.start_main_~#t550~0.offset_24|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_223, ULTIMATE.start_main_~#t550~0.base=|v_ULTIMATE.start_main_~#t550~0.base_36|, ~y~0=v_~y~0_94, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_131, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1093, ~z$w_buff0~0=v_~z$w_buff0~0_640, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_381, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_51|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_47, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_61, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_37|, ULTIMATE.start_main_~#t552~0.offset=|v_ULTIMATE.start_main_~#t552~0.offset_16|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_58|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_29|, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_25|, ~z~0=v_~z~0_310, ~weak$$choice2~0=v_~weak$$choice2~0_273, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_132} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_~#t551~0.offset, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t552~0.base, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_~#t549~0.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t549~0.base, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t551~0.base, ~z$mem_tmp~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t550~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t550~0.base, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_~#t552~0.offset, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 16:35:35,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1031] [1031] L851-1-->L853: Formula: (and (= (store |v_#valid_46| |v_ULTIMATE.start_main_~#t550~0.base_11| 1) |v_#valid_45|) (not (= |v_ULTIMATE.start_main_~#t550~0.base_11| 0)) (= 0 (select |v_#valid_46| |v_ULTIMATE.start_main_~#t550~0.base_11|)) (= |v_ULTIMATE.start_main_~#t550~0.offset_10| 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t550~0.base_11| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t550~0.base_11|) |v_ULTIMATE.start_main_~#t550~0.offset_10| 1)) |v_#memory_int_21|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t550~0.base_11| 4)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t550~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t550~0.offset=|v_ULTIMATE.start_main_~#t550~0.offset_10|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~#t550~0.base=|v_ULTIMATE.start_main_~#t550~0.base_11|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t550~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t550~0.base, #length] because there is no mapped edge [2019-12-07 16:35:35,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1030] [1030] L853-1-->L855: Formula: (and (= 0 (select |v_#valid_44| |v_ULTIMATE.start_main_~#t551~0.base_11|)) (= |v_#valid_43| (store |v_#valid_44| |v_ULTIMATE.start_main_~#t551~0.base_11| 1)) (= |v_ULTIMATE.start_main_~#t551~0.offset_11| 0) (not (= 0 |v_ULTIMATE.start_main_~#t551~0.base_11|)) (= |v_#memory_int_19| (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t551~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t551~0.base_11|) |v_ULTIMATE.start_main_~#t551~0.offset_11| 2))) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t551~0.base_11|) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t551~0.base_11| 4) |v_#length_21|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t551~0.base=|v_ULTIMATE.start_main_~#t551~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t551~0.offset=|v_ULTIMATE.start_main_~#t551~0.offset_11|, #valid=|v_#valid_43|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_19|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t551~0.base, ULTIMATE.start_main_~#t551~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length] because there is no mapped edge [2019-12-07 16:35:35,737 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L855-1-->L857: Formula: (and (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t552~0.base_9|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t552~0.base_9|) (= (store |v_#valid_36| |v_ULTIMATE.start_main_~#t552~0.base_9| 1) |v_#valid_35|) (not (= 0 |v_ULTIMATE.start_main_~#t552~0.base_9|)) (= 0 |v_ULTIMATE.start_main_~#t552~0.offset_8|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t552~0.base_9| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t552~0.base_9|) |v_ULTIMATE.start_main_~#t552~0.offset_8| 3)) |v_#memory_int_15|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t552~0.base_9| 4) |v_#length_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t552~0.offset=|v_ULTIMATE.start_main_~#t552~0.offset_8|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_4|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t552~0.base=|v_ULTIMATE.start_main_~#t552~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t552~0.offset, ULTIMATE.start_main_#t~nondet57, #valid, #memory_int, #length, ULTIMATE.start_main_~#t552~0.base] because there is no mapped edge [2019-12-07 16:35:35,738 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1036] [1036] L4-->L813: Formula: (and (= ~weak$$choice2~0_Out-938842631 ~z$flush_delayed~0_Out-938842631) (= |P3Thread1of1ForFork2_#t~nondet26_In-938842631| ~weak$$choice0~0_Out-938842631) (= ~z$r_buff0_thd1~0_In-938842631 ~z$r_buff1_thd1~0_Out-938842631) (= 1 ~z$r_buff0_thd4~0_Out-938842631) (= ~z~0_In-938842631 ~z$mem_tmp~0_Out-938842631) (not (= P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-938842631 0)) (= |P3Thread1of1ForFork2_#t~nondet27_In-938842631| ~weak$$choice2~0_Out-938842631) (= ~z$r_buff1_thd3~0_Out-938842631 ~z$r_buff0_thd3~0_In-938842631) (= ~z$r_buff0_thd2~0_In-938842631 ~z$r_buff1_thd2~0_Out-938842631) (= ~z$r_buff0_thd4~0_In-938842631 ~z$r_buff1_thd4~0_Out-938842631) (= ~z$r_buff1_thd0~0_Out-938842631 ~z$r_buff0_thd0~0_In-938842631)) InVars {P3Thread1of1ForFork2_#t~nondet26=|P3Thread1of1ForFork2_#t~nondet26_In-938842631|, P3Thread1of1ForFork2_#t~nondet27=|P3Thread1of1ForFork2_#t~nondet27_In-938842631|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-938842631, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-938842631, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-938842631, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-938842631, ~z~0=~z~0_In-938842631, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-938842631, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-938842631} OutVars{P3Thread1of1ForFork2_#t~nondet26=|P3Thread1of1ForFork2_#t~nondet26_Out-938842631|, ~z$mem_tmp~0=~z$mem_tmp~0_Out-938842631, P3Thread1of1ForFork2_#t~nondet27=|P3Thread1of1ForFork2_#t~nondet27_Out-938842631|, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-938842631, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out-938842631, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out-938842631, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-938842631, ~z$flush_delayed~0=~z$flush_delayed~0_Out-938842631, ~weak$$choice0~0=~weak$$choice0~0_Out-938842631, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-938842631, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-938842631, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-938842631, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-938842631, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-938842631, ~z~0=~z~0_In-938842631, ~weak$$choice2~0=~weak$$choice2~0_Out-938842631, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-938842631, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-938842631} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~nondet26, ~z$mem_tmp~0, P3Thread1of1ForFork2_#t~nondet27, ~weak$$choice0~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd4~0, ~z$flush_delayed~0, ~weak$$choice2~0] because there is no mapped edge [2019-12-07 16:35:35,739 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L813-2-->L813-5: Formula: (let ((.cse0 (= |P3Thread1of1ForFork2_#t~ite28_Out-535797904| |P3Thread1of1ForFork2_#t~ite29_Out-535797904|)) (.cse2 (= (mod ~z$w_buff0_used~0_In-535797904 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-535797904 256)))) (or (and .cse0 (= |P3Thread1of1ForFork2_#t~ite28_Out-535797904| ~z$w_buff0~0_In-535797904) (not .cse1) (not .cse2)) (and .cse0 (or .cse2 .cse1) (= |P3Thread1of1ForFork2_#t~ite28_Out-535797904| ~z$w_buff1~0_In-535797904)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-535797904, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-535797904, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-535797904, ~z$w_buff1~0=~z$w_buff1~0_In-535797904} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-535797904|, P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-535797904|, ~z$w_buff0~0=~z$w_buff0~0_In-535797904, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-535797904, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-535797904, ~z$w_buff1~0=~z$w_buff1~0_In-535797904} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 16:35:35,742 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L818-->L819: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_61 256))) (= v_~z$r_buff0_thd4~0_131 v_~z$r_buff0_thd4~0_130)) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_131, ~weak$$choice2~0=v_~weak$$choice2~0_61} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_10|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_9|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_61} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite42, P3Thread1of1ForFork2_#t~ite43, P3Thread1of1ForFork2_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 16:35:35,743 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L821-->L821-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-2124281737 256) 0))) (or (and (= |P3Thread1of1ForFork2_#t~ite48_Out-2124281737| ~z$mem_tmp~0_In-2124281737) (not .cse0)) (and .cse0 (= ~z~0_In-2124281737 |P3Thread1of1ForFork2_#t~ite48_Out-2124281737|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-2124281737, ~z$flush_delayed~0=~z$flush_delayed~0_In-2124281737, ~z~0=~z~0_In-2124281737} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-2124281737, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out-2124281737|, ~z$flush_delayed~0=~z$flush_delayed~0_In-2124281737, ~z~0=~z~0_In-2124281737} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-07 16:35:35,743 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1032] [1032] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= |v_P0Thread1of1ForFork3_#in~arg.offset_12| v_P0Thread1of1ForFork3_~arg.offset_10) (= v_P0Thread1of1ForFork3_~arg.base_10 |v_P0Thread1of1ForFork3_#in~arg.base_12|) (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= v_~a~0_15 1) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0) (= v_~x~0_17 v_~__unbuffered_p0_EAX~0_19)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_12|, ~x~0=v_~x~0_17} OutVars{~a~0=v_~a~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_19, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_12|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_10, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_10, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_12|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset] because there is no mapped edge [2019-12-07 16:35:35,744 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_6|) (= v_~y~0_35 1) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_6|) (= 1 v_~x~0_8)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41} OutVars{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_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, ~y~0=v_~y~0_35, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|, ~x~0=v_~x~0_8} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, ~y~0, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 16:35:35,750 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [985] [985] L829-->L829-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-2140341690 256))) (.cse1 (= (mod ~z$r_buff0_thd4~0_In-2140341690 256) 0))) (or (and (not .cse0) (= 0 |P3Thread1of1ForFork2_#t~ite51_Out-2140341690|) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-2140341690 |P3Thread1of1ForFork2_#t~ite51_Out-2140341690|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2140341690, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2140341690} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out-2140341690|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2140341690, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2140341690} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 16:35:35,750 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [972] [972] L783-->L783-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-1183066272 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite25_Out-1183066272| ~z$mem_tmp~0_In-1183066272) (not .cse0)) (and .cse0 (= |P2Thread1of1ForFork1_#t~ite25_Out-1183066272| ~z~0_In-1183066272)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-1183066272, ~z$flush_delayed~0=~z$flush_delayed~0_In-1183066272, ~z~0=~z~0_In-1183066272} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-1183066272, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out-1183066272|, ~z$flush_delayed~0=~z$flush_delayed~0_In-1183066272, ~z~0=~z~0_In-1183066272} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 16:35:35,751 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [988] [988] L830-->L830-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In1468199859 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1468199859 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In1468199859 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd4~0_In1468199859 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork2_#t~ite52_Out1468199859|)) (and (or .cse1 .cse0) (= ~z$w_buff1_used~0_In1468199859 |P3Thread1of1ForFork2_#t~ite52_Out1468199859|) (or .cse3 .cse2)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1468199859, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1468199859, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1468199859, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1468199859} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out1468199859|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1468199859, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1468199859, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1468199859, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1468199859} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-07 16:35:35,751 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L831-->L832: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd4~0_In-473412473 256) 0)) (.cse2 (= ~z$r_buff0_thd4~0_Out-473412473 ~z$r_buff0_thd4~0_In-473412473)) (.cse0 (= (mod ~z$w_buff0_used~0_In-473412473 256) 0))) (or (and (= 0 ~z$r_buff0_thd4~0_Out-473412473) (not .cse0) (not .cse1)) (and .cse1 .cse2) (and .cse2 .cse0))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-473412473, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-473412473} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out-473412473|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-473412473, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-473412473} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 16:35:35,751 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L832-->L832-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd4~0_In-1267193175 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1267193175 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-1267193175 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd4~0_In-1267193175 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd4~0_In-1267193175 |P3Thread1of1ForFork2_#t~ite54_Out-1267193175|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite54_Out-1267193175| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1267193175, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1267193175, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1267193175, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1267193175} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out-1267193175|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1267193175, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1267193175, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1267193175, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1267193175} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-07 16:35:35,751 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1021] [1021] L832-2-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= |v_P3Thread1of1ForFork2_#t~ite54_22| v_~z$r_buff1_thd4~0_191) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_21|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_191, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54, P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 16:35:35,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] L783-2-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_61 (+ v_~__unbuffered_cnt~0_62 1)) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 v_~z$flush_delayed~0_137) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= v_~z~0_175 |v_P2Thread1of1ForFork1_#t~ite25_36|)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_35|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ~z$flush_delayed~0=v_~z$flush_delayed~0_137, ~z~0=v_~z~0_175, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 16:35:35,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [922] [922] L861-->L863-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~z$w_buff0_used~0_139 256)) (= 0 (mod v_~z$r_buff0_thd0~0_18 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_139, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_139, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 16:35:35,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] L863-2-->L863-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-1717639028 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1717639028 256)))) (or (and (or .cse0 .cse1) (= ~z~0_In-1717639028 |ULTIMATE.start_main_#t~ite59_Out-1717639028|)) (and (not .cse1) (= ~z$w_buff1~0_In-1717639028 |ULTIMATE.start_main_#t~ite59_Out-1717639028|) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1717639028, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1717639028, ~z$w_buff1~0=~z$w_buff1~0_In-1717639028, ~z~0=~z~0_In-1717639028} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1717639028, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1717639028, ~z$w_buff1~0=~z$w_buff1~0_In-1717639028, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-1717639028|, ~z~0=~z~0_In-1717639028} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 16:35:35,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L863-4-->L864: Formula: (= v_~z~0_54 |v_ULTIMATE.start_main_#t~ite59_8|) InVars {ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_8|} OutVars{ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_10|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_7|, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59, ~z~0] because there is no mapped edge [2019-12-07 16:35:35,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L864-->L864-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-58804377 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-58804377 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite61_Out-58804377| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite61_Out-58804377| ~z$w_buff0_used~0_In-58804377) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-58804377, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-58804377} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-58804377, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-58804377|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-58804377} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 16:35:35,753 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [973] [973] L865-->L865-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd0~0_In1510782908 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1510782908 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1510782908 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1510782908 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite62_Out1510782908|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In1510782908 |ULTIMATE.start_main_#t~ite62_Out1510782908|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1510782908, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1510782908, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1510782908, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1510782908} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1510782908|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1510782908, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1510782908, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1510782908, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1510782908} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 16:35:35,753 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L866-->L866-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1485852406 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1485852406 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite63_Out1485852406| ~z$r_buff0_thd0~0_In1485852406)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite63_Out1485852406|) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1485852406, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1485852406} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out1485852406|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1485852406, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1485852406} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 16:35:35,754 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [980] [980] L867-->L867-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-1826668374 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-1826668374 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1826668374 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1826668374 256)))) (or (and (= |ULTIMATE.start_main_#t~ite64_Out-1826668374| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite64_Out-1826668374| ~z$r_buff1_thd0~0_In-1826668374)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1826668374, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1826668374, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1826668374, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1826668374} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1826668374, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1826668374, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1826668374, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1826668374, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out-1826668374|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 16:35:35,754 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1043] [1043] L867-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_19 (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p0_EAX~0_31) (= 0 v_~__unbuffered_p2_EAX~0_33) (= v_~y~0_56 2) (= 1 v_~__unbuffered_p3_EAX~0_35) (= 0 v_~__unbuffered_p3_EBX~0_22))) 1 0)) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~z$r_buff1_thd0~0_171 |v_ULTIMATE.start_main_#t~ite64_41|) (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_31, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_35, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~y~0=v_~y~0_56, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_41|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_31, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_171, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_35, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~y~0=v_~y~0_56, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_40|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 16:35:35,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 04:35:35 BasicIcfg [2019-12-07 16:35:35,863 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 16:35:35,863 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 16:35:35,864 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 16:35:35,864 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 16:35:35,864 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:31:34" (3/4) ... [2019-12-07 16:35:35,865 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 16:35:35,866 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1061] [1061] ULTIMATE.startENTRY-->L851: Formula: (let ((.cse0 (store |v_#valid_85| 0 0))) (and (= v_~__unbuffered_cnt~0_140 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t549~0.base_34|)) (= v_~z$r_buff0_thd2~0_131 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t549~0.base_34| 1) |v_#valid_83|) (= (store |v_#length_28| |v_ULTIMATE.start_main_~#t549~0.base_34| 4) |v_#length_27|) (= 0 v_~z$flush_delayed~0_223) (= 0 v_~__unbuffered_p3_EAX~0_84) (= |v_#NULL.offset_6| 0) (= v_~z$w_buff1~0_366 0) (= v_~z$r_buff0_thd0~0_214 0) (= v_~z$r_buff1_thd2~0_149 0) (= v_~z$read_delayed~0_8 0) (= v_~z$r_buff1_thd1~0_149 0) (= v_~z$read_delayed_var~0.base_8 0) (= v_~main$tmp_guard1~0_56 0) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t549~0.base_34|) (= v_~z$r_buff0_thd1~0_132 0) (= 0 v_~z$r_buff1_thd4~0_351) (= v_~a~0_48 0) (= 0 v_~z$mem_tmp~0_195) (= 0 |v_#NULL.base_6|) (= v_~z$w_buff1_used~0_712 0) (= v_~z$r_buff1_thd0~0_223 0) (= 0 v_~__unbuffered_p2_EAX~0_71) (< 0 |v_#StackHeapBarrier_20|) (= v_~z$w_buff0~0_640 0) (= v_~main$tmp_guard0~0_47 0) (= 0 v_~__unbuffered_p3_EBX~0_61) (= v_~y~0_94 0) (= 0 v_~z$r_buff0_thd3~0_453) (= v_~z$w_buff0_used~0_1093 0) (= 0 |v_ULTIMATE.start_main_~#t549~0.offset_23|) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t549~0.base_34| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t549~0.base_34|) |v_ULTIMATE.start_main_~#t549~0.offset_23| 0)) |v_#memory_int_25|) (= v_~weak$$choice2~0_273 0) (= 0 v_~weak$$choice0~0_182) (= 0 v_~z$r_buff0_thd4~0_575) (= v_~z~0_310 0) (= 0 v_~__unbuffered_p0_EAX~0_80) (= 0 v_~z$r_buff1_thd3~0_381) (= v_~z$read_delayed_var~0.offset_8 0) (= v_~x~0_47 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_85|, #memory_int=|v_#memory_int_26|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_7|, ULTIMATE.start_main_~#t551~0.offset=|v_ULTIMATE.start_main_~#t551~0.offset_17|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_7|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_149, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t552~0.base=|v_ULTIMATE.start_main_~#t552~0.base_22|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_111|, ULTIMATE.start_main_~#t549~0.offset=|v_ULTIMATE.start_main_~#t549~0.offset_23|, ~a~0=v_~a~0_48, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_214, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_80, ULTIMATE.start_main_~#t549~0.base=|v_ULTIMATE.start_main_~#t549~0.base_34|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_575, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_84, #length=|v_#length_27|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_71, ULTIMATE.start_main_~#t551~0.base=|v_ULTIMATE.start_main_~#t551~0.base_28|, ~z$mem_tmp~0=v_~z$mem_tmp~0_195, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_712, ~z$flush_delayed~0=v_~z$flush_delayed~0_223, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_43|, ~weak$$choice0~0=v_~weak$$choice0~0_182, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_183|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_149, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_453, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_140, ~x~0=v_~x~0_47, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_351, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_24|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_7|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ~z$w_buff1~0=v_~z$w_buff1~0_366, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_56, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ULTIMATE.start_main_~#t550~0.offset=|v_ULTIMATE.start_main_~#t550~0.offset_24|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_223, ULTIMATE.start_main_~#t550~0.base=|v_ULTIMATE.start_main_~#t550~0.base_36|, ~y~0=v_~y~0_94, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_131, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1093, ~z$w_buff0~0=v_~z$w_buff0~0_640, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_381, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_51|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_47, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_61, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_37|, ULTIMATE.start_main_~#t552~0.offset=|v_ULTIMATE.start_main_~#t552~0.offset_16|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_58|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_29|, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_25|, ~z~0=v_~z~0_310, ~weak$$choice2~0=v_~weak$$choice2~0_273, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_132} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_~#t551~0.offset, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t552~0.base, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_~#t549~0.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t549~0.base, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t551~0.base, ~z$mem_tmp~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t550~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t550~0.base, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_~#t552~0.offset, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 16:35:35,866 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1031] [1031] L851-1-->L853: Formula: (and (= (store |v_#valid_46| |v_ULTIMATE.start_main_~#t550~0.base_11| 1) |v_#valid_45|) (not (= |v_ULTIMATE.start_main_~#t550~0.base_11| 0)) (= 0 (select |v_#valid_46| |v_ULTIMATE.start_main_~#t550~0.base_11|)) (= |v_ULTIMATE.start_main_~#t550~0.offset_10| 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t550~0.base_11| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t550~0.base_11|) |v_ULTIMATE.start_main_~#t550~0.offset_10| 1)) |v_#memory_int_21|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t550~0.base_11| 4)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t550~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t550~0.offset=|v_ULTIMATE.start_main_~#t550~0.offset_10|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~#t550~0.base=|v_ULTIMATE.start_main_~#t550~0.base_11|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t550~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t550~0.base, #length] because there is no mapped edge [2019-12-07 16:35:35,867 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1030] [1030] L853-1-->L855: Formula: (and (= 0 (select |v_#valid_44| |v_ULTIMATE.start_main_~#t551~0.base_11|)) (= |v_#valid_43| (store |v_#valid_44| |v_ULTIMATE.start_main_~#t551~0.base_11| 1)) (= |v_ULTIMATE.start_main_~#t551~0.offset_11| 0) (not (= 0 |v_ULTIMATE.start_main_~#t551~0.base_11|)) (= |v_#memory_int_19| (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t551~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t551~0.base_11|) |v_ULTIMATE.start_main_~#t551~0.offset_11| 2))) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t551~0.base_11|) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t551~0.base_11| 4) |v_#length_21|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t551~0.base=|v_ULTIMATE.start_main_~#t551~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t551~0.offset=|v_ULTIMATE.start_main_~#t551~0.offset_11|, #valid=|v_#valid_43|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_19|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t551~0.base, ULTIMATE.start_main_~#t551~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length] because there is no mapped edge [2019-12-07 16:35:35,867 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L855-1-->L857: Formula: (and (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t552~0.base_9|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t552~0.base_9|) (= (store |v_#valid_36| |v_ULTIMATE.start_main_~#t552~0.base_9| 1) |v_#valid_35|) (not (= 0 |v_ULTIMATE.start_main_~#t552~0.base_9|)) (= 0 |v_ULTIMATE.start_main_~#t552~0.offset_8|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t552~0.base_9| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t552~0.base_9|) |v_ULTIMATE.start_main_~#t552~0.offset_8| 3)) |v_#memory_int_15|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t552~0.base_9| 4) |v_#length_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t552~0.offset=|v_ULTIMATE.start_main_~#t552~0.offset_8|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_4|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t552~0.base=|v_ULTIMATE.start_main_~#t552~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t552~0.offset, ULTIMATE.start_main_#t~nondet57, #valid, #memory_int, #length, ULTIMATE.start_main_~#t552~0.base] because there is no mapped edge [2019-12-07 16:35:35,868 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1036] [1036] L4-->L813: Formula: (and (= ~weak$$choice2~0_Out-938842631 ~z$flush_delayed~0_Out-938842631) (= |P3Thread1of1ForFork2_#t~nondet26_In-938842631| ~weak$$choice0~0_Out-938842631) (= ~z$r_buff0_thd1~0_In-938842631 ~z$r_buff1_thd1~0_Out-938842631) (= 1 ~z$r_buff0_thd4~0_Out-938842631) (= ~z~0_In-938842631 ~z$mem_tmp~0_Out-938842631) (not (= P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-938842631 0)) (= |P3Thread1of1ForFork2_#t~nondet27_In-938842631| ~weak$$choice2~0_Out-938842631) (= ~z$r_buff1_thd3~0_Out-938842631 ~z$r_buff0_thd3~0_In-938842631) (= ~z$r_buff0_thd2~0_In-938842631 ~z$r_buff1_thd2~0_Out-938842631) (= ~z$r_buff0_thd4~0_In-938842631 ~z$r_buff1_thd4~0_Out-938842631) (= ~z$r_buff1_thd0~0_Out-938842631 ~z$r_buff0_thd0~0_In-938842631)) InVars {P3Thread1of1ForFork2_#t~nondet26=|P3Thread1of1ForFork2_#t~nondet26_In-938842631|, P3Thread1of1ForFork2_#t~nondet27=|P3Thread1of1ForFork2_#t~nondet27_In-938842631|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-938842631, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-938842631, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-938842631, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-938842631, ~z~0=~z~0_In-938842631, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-938842631, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-938842631} OutVars{P3Thread1of1ForFork2_#t~nondet26=|P3Thread1of1ForFork2_#t~nondet26_Out-938842631|, ~z$mem_tmp~0=~z$mem_tmp~0_Out-938842631, P3Thread1of1ForFork2_#t~nondet27=|P3Thread1of1ForFork2_#t~nondet27_Out-938842631|, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-938842631, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out-938842631, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out-938842631, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-938842631, ~z$flush_delayed~0=~z$flush_delayed~0_Out-938842631, ~weak$$choice0~0=~weak$$choice0~0_Out-938842631, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-938842631, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-938842631, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-938842631, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-938842631, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-938842631, ~z~0=~z~0_In-938842631, ~weak$$choice2~0=~weak$$choice2~0_Out-938842631, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-938842631, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-938842631} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~nondet26, ~z$mem_tmp~0, P3Thread1of1ForFork2_#t~nondet27, ~weak$$choice0~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd4~0, ~z$flush_delayed~0, ~weak$$choice2~0] because there is no mapped edge [2019-12-07 16:35:35,868 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L813-2-->L813-5: Formula: (let ((.cse0 (= |P3Thread1of1ForFork2_#t~ite28_Out-535797904| |P3Thread1of1ForFork2_#t~ite29_Out-535797904|)) (.cse2 (= (mod ~z$w_buff0_used~0_In-535797904 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-535797904 256)))) (or (and .cse0 (= |P3Thread1of1ForFork2_#t~ite28_Out-535797904| ~z$w_buff0~0_In-535797904) (not .cse1) (not .cse2)) (and .cse0 (or .cse2 .cse1) (= |P3Thread1of1ForFork2_#t~ite28_Out-535797904| ~z$w_buff1~0_In-535797904)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-535797904, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-535797904, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-535797904, ~z$w_buff1~0=~z$w_buff1~0_In-535797904} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-535797904|, P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-535797904|, ~z$w_buff0~0=~z$w_buff0~0_In-535797904, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-535797904, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-535797904, ~z$w_buff1~0=~z$w_buff1~0_In-535797904} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 16:35:35,871 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L818-->L819: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_61 256))) (= v_~z$r_buff0_thd4~0_131 v_~z$r_buff0_thd4~0_130)) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_131, ~weak$$choice2~0=v_~weak$$choice2~0_61} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_10|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_9|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_61} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite42, P3Thread1of1ForFork2_#t~ite43, P3Thread1of1ForFork2_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 16:35:35,872 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L821-->L821-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-2124281737 256) 0))) (or (and (= |P3Thread1of1ForFork2_#t~ite48_Out-2124281737| ~z$mem_tmp~0_In-2124281737) (not .cse0)) (and .cse0 (= ~z~0_In-2124281737 |P3Thread1of1ForFork2_#t~ite48_Out-2124281737|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-2124281737, ~z$flush_delayed~0=~z$flush_delayed~0_In-2124281737, ~z~0=~z~0_In-2124281737} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-2124281737, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out-2124281737|, ~z$flush_delayed~0=~z$flush_delayed~0_In-2124281737, ~z~0=~z~0_In-2124281737} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-07 16:35:35,873 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1032] [1032] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= |v_P0Thread1of1ForFork3_#in~arg.offset_12| v_P0Thread1of1ForFork3_~arg.offset_10) (= v_P0Thread1of1ForFork3_~arg.base_10 |v_P0Thread1of1ForFork3_#in~arg.base_12|) (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= v_~a~0_15 1) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0) (= v_~x~0_17 v_~__unbuffered_p0_EAX~0_19)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_12|, ~x~0=v_~x~0_17} OutVars{~a~0=v_~a~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_19, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_12|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_10, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_10, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_12|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset] because there is no mapped edge [2019-12-07 16:35:35,873 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_6|) (= v_~y~0_35 1) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_6|) (= 1 v_~x~0_8)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41} OutVars{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_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, ~y~0=v_~y~0_35, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|, ~x~0=v_~x~0_8} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, ~y~0, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 16:35:35,879 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [985] [985] L829-->L829-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-2140341690 256))) (.cse1 (= (mod ~z$r_buff0_thd4~0_In-2140341690 256) 0))) (or (and (not .cse0) (= 0 |P3Thread1of1ForFork2_#t~ite51_Out-2140341690|) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-2140341690 |P3Thread1of1ForFork2_#t~ite51_Out-2140341690|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2140341690, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2140341690} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out-2140341690|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2140341690, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2140341690} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 16:35:35,879 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [972] [972] L783-->L783-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-1183066272 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite25_Out-1183066272| ~z$mem_tmp~0_In-1183066272) (not .cse0)) (and .cse0 (= |P2Thread1of1ForFork1_#t~ite25_Out-1183066272| ~z~0_In-1183066272)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-1183066272, ~z$flush_delayed~0=~z$flush_delayed~0_In-1183066272, ~z~0=~z~0_In-1183066272} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-1183066272, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out-1183066272|, ~z$flush_delayed~0=~z$flush_delayed~0_In-1183066272, ~z~0=~z~0_In-1183066272} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 16:35:35,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [988] [988] L830-->L830-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In1468199859 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1468199859 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In1468199859 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd4~0_In1468199859 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork2_#t~ite52_Out1468199859|)) (and (or .cse1 .cse0) (= ~z$w_buff1_used~0_In1468199859 |P3Thread1of1ForFork2_#t~ite52_Out1468199859|) (or .cse3 .cse2)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1468199859, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1468199859, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1468199859, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1468199859} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out1468199859|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1468199859, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1468199859, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1468199859, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1468199859} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-07 16:35:35,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L831-->L832: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd4~0_In-473412473 256) 0)) (.cse2 (= ~z$r_buff0_thd4~0_Out-473412473 ~z$r_buff0_thd4~0_In-473412473)) (.cse0 (= (mod ~z$w_buff0_used~0_In-473412473 256) 0))) (or (and (= 0 ~z$r_buff0_thd4~0_Out-473412473) (not .cse0) (not .cse1)) (and .cse1 .cse2) (and .cse2 .cse0))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-473412473, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-473412473} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out-473412473|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-473412473, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-473412473} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 16:35:35,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L832-->L832-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd4~0_In-1267193175 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1267193175 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-1267193175 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd4~0_In-1267193175 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd4~0_In-1267193175 |P3Thread1of1ForFork2_#t~ite54_Out-1267193175|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite54_Out-1267193175| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1267193175, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1267193175, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1267193175, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1267193175} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out-1267193175|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1267193175, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1267193175, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1267193175, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1267193175} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-07 16:35:35,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1021] [1021] L832-2-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= |v_P3Thread1of1ForFork2_#t~ite54_22| v_~z$r_buff1_thd4~0_191) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_21|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_191, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54, P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 16:35:35,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] L783-2-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_61 (+ v_~__unbuffered_cnt~0_62 1)) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 v_~z$flush_delayed~0_137) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= v_~z~0_175 |v_P2Thread1of1ForFork1_#t~ite25_36|)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_35|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ~z$flush_delayed~0=v_~z$flush_delayed~0_137, ~z~0=v_~z~0_175, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 16:35:35,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [922] [922] L861-->L863-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~z$w_buff0_used~0_139 256)) (= 0 (mod v_~z$r_buff0_thd0~0_18 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_139, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_139, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 16:35:35,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] L863-2-->L863-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-1717639028 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1717639028 256)))) (or (and (or .cse0 .cse1) (= ~z~0_In-1717639028 |ULTIMATE.start_main_#t~ite59_Out-1717639028|)) (and (not .cse1) (= ~z$w_buff1~0_In-1717639028 |ULTIMATE.start_main_#t~ite59_Out-1717639028|) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1717639028, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1717639028, ~z$w_buff1~0=~z$w_buff1~0_In-1717639028, ~z~0=~z~0_In-1717639028} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1717639028, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1717639028, ~z$w_buff1~0=~z$w_buff1~0_In-1717639028, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-1717639028|, ~z~0=~z~0_In-1717639028} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 16:35:35,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L863-4-->L864: Formula: (= v_~z~0_54 |v_ULTIMATE.start_main_#t~ite59_8|) InVars {ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_8|} OutVars{ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_10|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_7|, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59, ~z~0] because there is no mapped edge [2019-12-07 16:35:35,881 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L864-->L864-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-58804377 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-58804377 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite61_Out-58804377| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite61_Out-58804377| ~z$w_buff0_used~0_In-58804377) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-58804377, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-58804377} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-58804377, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-58804377|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-58804377} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 16:35:35,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [973] [973] L865-->L865-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd0~0_In1510782908 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1510782908 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1510782908 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1510782908 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite62_Out1510782908|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In1510782908 |ULTIMATE.start_main_#t~ite62_Out1510782908|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1510782908, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1510782908, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1510782908, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1510782908} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1510782908|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1510782908, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1510782908, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1510782908, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1510782908} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 16:35:35,882 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L866-->L866-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1485852406 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1485852406 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite63_Out1485852406| ~z$r_buff0_thd0~0_In1485852406)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite63_Out1485852406|) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1485852406, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1485852406} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out1485852406|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1485852406, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1485852406} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 16:35:35,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [980] [980] L867-->L867-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-1826668374 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-1826668374 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1826668374 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1826668374 256)))) (or (and (= |ULTIMATE.start_main_#t~ite64_Out-1826668374| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite64_Out-1826668374| ~z$r_buff1_thd0~0_In-1826668374)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1826668374, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1826668374, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1826668374, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1826668374} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1826668374, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1826668374, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1826668374, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1826668374, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out-1826668374|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 16:35:35,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1043] [1043] L867-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_19 (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p0_EAX~0_31) (= 0 v_~__unbuffered_p2_EAX~0_33) (= v_~y~0_56 2) (= 1 v_~__unbuffered_p3_EAX~0_35) (= 0 v_~__unbuffered_p3_EBX~0_22))) 1 0)) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~z$r_buff1_thd0~0_171 |v_ULTIMATE.start_main_#t~ite64_41|) (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_31, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_35, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~y~0=v_~y~0_56, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_41|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_31, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_171, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_35, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~y~0=v_~y~0_56, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_40|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 16:35:35,942 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_cd74bc8b-511c-41e7-b9f4-2dedb1f36722/bin/uautomizer/witness.graphml [2019-12-07 16:35:35,942 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 16:35:35,943 INFO L168 Benchmark]: Toolchain (without parser) took 242715.44 ms. Allocated memory was 1.0 GB in the beginning and 10.1 GB in the end (delta: 9.1 GB). Free memory was 940.9 MB in the beginning and 6.8 GB in the end (delta: -5.8 GB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. [2019-12-07 16:35:35,943 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:35:35,944 INFO L168 Benchmark]: CACSL2BoogieTranslator took 396.73 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -133.0 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-12-07 16:35:35,944 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.50 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 16:35:35,944 INFO L168 Benchmark]: Boogie Preprocessor took 29.24 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 16:35:35,944 INFO L168 Benchmark]: RCFGBuilder took 453.10 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: 60.6 MB). Peak memory consumption was 60.6 MB. Max. memory is 11.5 GB. [2019-12-07 16:35:35,945 INFO L168 Benchmark]: TraceAbstraction took 241708.37 ms. Allocated memory was 1.1 GB in the beginning and 10.1 GB in the end (delta: 9.0 GB). Free memory was 1.0 GB in the beginning and 6.8 GB in the end (delta: -5.8 GB). Peak memory consumption was 4.9 GB. Max. memory is 11.5 GB. [2019-12-07 16:35:35,945 INFO L168 Benchmark]: Witness Printer took 78.79 ms. Allocated memory is still 10.1 GB. Free memory was 6.8 GB in the beginning and 6.8 GB in the end (delta: 37.8 MB). Peak memory consumption was 37.8 MB. Max. memory is 11.5 GB. [2019-12-07 16:35:35,946 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 396.73 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -133.0 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.50 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.24 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 453.10 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: 60.6 MB). Peak memory consumption was 60.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 241708.37 ms. Allocated memory was 1.1 GB in the beginning and 10.1 GB in the end (delta: 9.0 GB). Free memory was 1.0 GB in the beginning and 6.8 GB in the end (delta: -5.8 GB). Peak memory consumption was 4.9 GB. Max. memory is 11.5 GB. * Witness Printer took 78.79 ms. Allocated memory is still 10.1 GB. Free memory was 6.8 GB in the beginning and 6.8 GB in the end (delta: 37.8 MB). Peak memory consumption was 37.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.2s, 211 ProgramPointsBefore, 112 ProgramPointsAfterwards, 254 TransitionsBefore, 131 TransitionsAfterwards, 26510 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 51 ConcurrentYvCompositions, 29 ChoiceCompositions, 11182 VarBasedMoverChecksPositive, 338 VarBasedMoverChecksNegative, 64 SemBasedMoverChecksPositive, 381 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 142340 CheckedPairsTotal, 134 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L851] FCALL, FORK 0 pthread_create(&t549, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L853] FCALL, FORK 0 pthread_create(&t550, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] FCALL, FORK 0 pthread_create(&t551, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] FCALL, FORK 0 pthread_create(&t552, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] 4 z$w_buff1 = z$w_buff0 [L797] 4 z$w_buff0 = 1 [L798] 4 z$w_buff1_used = z$w_buff0_used [L799] 4 z$w_buff0_used = (_Bool)1 [L813] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L813] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L814] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L814] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L815] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L815] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L816] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L816] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L817] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L817] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L819] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L820] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 z = z$flush_delayed ? z$mem_tmp : z [L822] 4 z$flush_delayed = (_Bool)0 [L825] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L828] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 3 y = 2 [L771] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 3 z$flush_delayed = weak$$choice2 [L774] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L776] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L777] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L778] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L779] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L780] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L781] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L782] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L828] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L829] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L830] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L859] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L864] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L865] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L866] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 199 locations, 2 error locations. Result: UNSAFE, OverallTime: 241.4s, OverallIterations: 26, TraceHistogramMax: 1, AutomataDifference: 65.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6470 SDtfs, 10790 SDslu, 16179 SDs, 0 SdLazy, 6458 SolverSat, 420 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 236 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 761 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=398430occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 156.8s AutomataMinimizationTime, 25 MinimizatonAttempts, 1020760 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 949 NumberOfCodeBlocks, 949 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 858 ConstructedInterpolants, 0 QuantifiedInterpolants, 190306 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...