./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix022_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_fa8e2214-d371-4faf-8edc-4cf4feb9ffc3/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_fa8e2214-d371-4faf-8edc-4cf4feb9ffc3/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_fa8e2214-d371-4faf-8edc-4cf4feb9ffc3/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_fa8e2214-d371-4faf-8edc-4cf4feb9ffc3/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix022_tso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_fa8e2214-d371-4faf-8edc-4cf4feb9ffc3/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_fa8e2214-d371-4faf-8edc-4cf4feb9ffc3/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 84bb6a1528610dde20e8643363affa59d0e667e6 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 11:08:02,372 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:08:02,374 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:08:02,384 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:08:02,384 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:08:02,385 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:08:02,386 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:08:02,388 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:08:02,389 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:08:02,390 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:08:02,391 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:08:02,392 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:08:02,392 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:08:02,393 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:08:02,393 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:08:02,394 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:08:02,395 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:08:02,396 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:08:02,398 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:08:02,400 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:08:02,401 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:08:02,402 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:08:02,403 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:08:02,404 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:08:02,406 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:08:02,406 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:08:02,406 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:08:02,406 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:08:02,407 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:08:02,408 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:08:02,408 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:08:02,408 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:08:02,409 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:08:02,409 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:08:02,410 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:08:02,410 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:08:02,411 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:08:02,411 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:08:02,411 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:08:02,412 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:08:02,413 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:08:02,413 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_fa8e2214-d371-4faf-8edc-4cf4feb9ffc3/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 11:08:02,422 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:08:02,422 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:08:02,423 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 11:08:02,423 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 11:08:02,423 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 11:08:02,423 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:08:02,424 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:08:02,424 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:08:02,424 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:08:02,424 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:08:02,424 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 11:08:02,424 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:08:02,424 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 11:08:02,424 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:08:02,424 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:08:02,424 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:08:02,425 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 11:08:02,425 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:08:02,425 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 11:08:02,425 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:08:02,425 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:08:02,425 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:08:02,425 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:08:02,425 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:08:02,425 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 11:08:02,426 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 11:08:02,426 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:08:02,426 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 11:08:02,426 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:08:02,426 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_fa8e2214-d371-4faf-8edc-4cf4feb9ffc3/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 -> 84bb6a1528610dde20e8643363affa59d0e667e6 [2019-12-07 11:08:02,530 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:08:02,540 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:08:02,543 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:08:02,544 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:08:02,545 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:08:02,545 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_fa8e2214-d371-4faf-8edc-4cf4feb9ffc3/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix022_tso.oepc.i [2019-12-07 11:08:02,586 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fa8e2214-d371-4faf-8edc-4cf4feb9ffc3/bin/uautomizer/data/d4f1aa6e8/a7e40c6db31747b6b6cd5bfea70fbc5f/FLAG6922051db [2019-12-07 11:08:03,048 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:08:03,049 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_fa8e2214-d371-4faf-8edc-4cf4feb9ffc3/sv-benchmarks/c/pthread-wmm/mix022_tso.oepc.i [2019-12-07 11:08:03,059 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fa8e2214-d371-4faf-8edc-4cf4feb9ffc3/bin/uautomizer/data/d4f1aa6e8/a7e40c6db31747b6b6cd5bfea70fbc5f/FLAG6922051db [2019-12-07 11:08:03,067 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_fa8e2214-d371-4faf-8edc-4cf4feb9ffc3/bin/uautomizer/data/d4f1aa6e8/a7e40c6db31747b6b6cd5bfea70fbc5f [2019-12-07 11:08:03,069 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:08:03,070 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:08:03,071 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:08:03,071 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:08:03,073 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:08:03,073 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:08:03" (1/1) ... [2019-12-07 11:08:03,075 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bd1e142 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:08:03, skipping insertion in model container [2019-12-07 11:08:03,075 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:08:03" (1/1) ... [2019-12-07 11:08:03,080 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:08:03,108 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:08:03,355 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:08:03,363 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:08:03,408 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:08:03,455 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:08:03,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:08:03 WrapperNode [2019-12-07 11:08:03,456 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:08:03,456 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:08:03,456 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:08:03,456 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:08:03,462 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:08:03" (1/1) ... [2019-12-07 11:08:03,476 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:08:03" (1/1) ... [2019-12-07 11:08:03,501 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:08:03,502 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:08:03,502 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:08:03,502 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:08:03,508 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:08:03" (1/1) ... [2019-12-07 11:08:03,509 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:08:03" (1/1) ... [2019-12-07 11:08:03,512 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:08:03" (1/1) ... [2019-12-07 11:08:03,513 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:08:03" (1/1) ... [2019-12-07 11:08:03,520 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:08:03" (1/1) ... [2019-12-07 11:08:03,524 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:08:03" (1/1) ... [2019-12-07 11:08:03,527 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:08:03" (1/1) ... [2019-12-07 11:08:03,531 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:08:03,531 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:08:03,531 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:08:03,531 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:08:03,532 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:08:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fa8e2214-d371-4faf-8edc-4cf4feb9ffc3/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 11:08:03,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 11:08:03,573 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 11:08:03,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 11:08:03,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 11:08:03,573 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 11:08:03,573 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 11:08:03,573 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 11:08:03,574 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 11:08:03,574 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 11:08:03,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:08:03,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:08:03,575 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 11:08:03,985 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:08:03,985 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 11:08:03,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:08:03 BoogieIcfgContainer [2019-12-07 11:08:03,986 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:08:03,987 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:08:03,987 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:08:03,989 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:08:03,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:08:03" (1/3) ... [2019-12-07 11:08:03,989 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a3fe9b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:08:03, skipping insertion in model container [2019-12-07 11:08:03,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:08:03" (2/3) ... [2019-12-07 11:08:03,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a3fe9b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:08:03, skipping insertion in model container [2019-12-07 11:08:03,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:08:03" (3/3) ... [2019-12-07 11:08:03,991 INFO L109 eAbstractionObserver]: Analyzing ICFG mix022_tso.oepc.i [2019-12-07 11:08:03,997 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 11:08:03,997 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:08:04,002 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 11:08:04,003 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 11:08:04,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,027 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,027 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,027 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,028 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,029 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,030 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,031 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,032 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,032 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,032 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,032 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,032 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,043 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,044 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:08:04,057 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 11:08:04,074 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:08:04,074 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 11:08:04,075 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:08:04,075 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:08:04,075 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:08:04,075 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:08:04,075 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:08:04,075 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:08:04,090 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 189 places, 244 transitions [2019-12-07 11:08:04,091 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 189 places, 244 transitions [2019-12-07 11:08:04,152 INFO L134 PetriNetUnfolder]: 62/242 cut-off events. [2019-12-07 11:08:04,153 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 11:08:04,165 INFO L76 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 242 events. 62/242 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 868 event pairs. 6/184 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-07 11:08:04,187 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 189 places, 244 transitions [2019-12-07 11:08:04,220 INFO L134 PetriNetUnfolder]: 62/242 cut-off events. [2019-12-07 11:08:04,221 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 11:08:04,228 INFO L76 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 242 events. 62/242 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 868 event pairs. 6/184 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-07 11:08:04,252 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 25246 [2019-12-07 11:08:04,253 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 11:08:07,304 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-07 11:08:07,393 INFO L206 etLargeBlockEncoding]: Checked pairs total: 142941 [2019-12-07 11:08:07,393 INFO L214 etLargeBlockEncoding]: Total number of compositions: 118 [2019-12-07 11:08:07,396 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 112 places, 137 transitions [2019-12-07 11:08:08,668 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27484 states. [2019-12-07 11:08:08,669 INFO L276 IsEmpty]: Start isEmpty. Operand 27484 states. [2019-12-07 11:08:08,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 11:08:08,673 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:08:08,674 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 11:08:08,674 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:08:08,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:08:08,677 INFO L82 PathProgramCache]: Analyzing trace with hash 980256966, now seen corresponding path program 1 times [2019-12-07 11:08:08,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:08:08,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739421581] [2019-12-07 11:08:08,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:08:08,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:08:08,817 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 11:08:08,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739421581] [2019-12-07 11:08:08,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:08:08,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 11:08:08,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996736265] [2019-12-07 11:08:08,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:08:08,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:08:08,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:08:08,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:08:08,832 INFO L87 Difference]: Start difference. First operand 27484 states. Second operand 3 states. [2019-12-07 11:08:09,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:08:09,166 INFO L93 Difference]: Finished difference Result 27436 states and 97226 transitions. [2019-12-07 11:08:09,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:08:09,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 11:08:09,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:08:09,380 INFO L225 Difference]: With dead ends: 27436 [2019-12-07 11:08:09,380 INFO L226 Difference]: Without dead ends: 26890 [2019-12-07 11:08:09,381 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 11:08:09,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26890 states. [2019-12-07 11:08:10,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26890 to 26890. [2019-12-07 11:08:10,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26890 states. [2019-12-07 11:08:10,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26890 states to 26890 states and 95406 transitions. [2019-12-07 11:08:10,355 INFO L78 Accepts]: Start accepts. Automaton has 26890 states and 95406 transitions. Word has length 5 [2019-12-07 11:08:10,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:08:10,356 INFO L462 AbstractCegarLoop]: Abstraction has 26890 states and 95406 transitions. [2019-12-07 11:08:10,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:08:10,356 INFO L276 IsEmpty]: Start isEmpty. Operand 26890 states and 95406 transitions. [2019-12-07 11:08:10,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 11:08:10,359 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:08:10,359 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:08:10,359 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:08:10,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:08:10,359 INFO L82 PathProgramCache]: Analyzing trace with hash -661538299, now seen corresponding path program 1 times [2019-12-07 11:08:10,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:08:10,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098706028] [2019-12-07 11:08:10,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:08:10,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:08:10,424 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 11:08:10,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098706028] [2019-12-07 11:08:10,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:08:10,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:08:10,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647332067] [2019-12-07 11:08:10,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:08:10,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:08:10,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:08:10,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:08:10,426 INFO L87 Difference]: Start difference. First operand 26890 states and 95406 transitions. Second operand 4 states. [2019-12-07 11:08:10,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:08:10,775 INFO L93 Difference]: Finished difference Result 43282 states and 146547 transitions. [2019-12-07 11:08:10,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:08:10,776 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 11:08:10,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:08:10,862 INFO L225 Difference]: With dead ends: 43282 [2019-12-07 11:08:10,862 INFO L226 Difference]: Without dead ends: 43275 [2019-12-07 11:08:10,862 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 11:08:11,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43275 states. [2019-12-07 11:08:11,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43275 to 41962. [2019-12-07 11:08:11,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41962 states. [2019-12-07 11:08:11,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41962 states to 41962 states and 143055 transitions. [2019-12-07 11:08:11,993 INFO L78 Accepts]: Start accepts. Automaton has 41962 states and 143055 transitions. Word has length 11 [2019-12-07 11:08:11,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:08:11,993 INFO L462 AbstractCegarLoop]: Abstraction has 41962 states and 143055 transitions. [2019-12-07 11:08:11,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:08:11,993 INFO L276 IsEmpty]: Start isEmpty. Operand 41962 states and 143055 transitions. [2019-12-07 11:08:11,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 11:08:11,995 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:08:11,995 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:08:11,995 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:08:11,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:08:11,995 INFO L82 PathProgramCache]: Analyzing trace with hash -2102667274, now seen corresponding path program 1 times [2019-12-07 11:08:11,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:08:11,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794845397] [2019-12-07 11:08:11,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:08:12,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:08:12,041 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 11:08:12,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794845397] [2019-12-07 11:08:12,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:08:12,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:08:12,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116810962] [2019-12-07 11:08:12,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:08:12,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:08:12,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:08:12,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:08:12,042 INFO L87 Difference]: Start difference. First operand 41962 states and 143055 transitions. Second operand 4 states. [2019-12-07 11:08:12,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:08:12,353 INFO L93 Difference]: Finished difference Result 53078 states and 178895 transitions. [2019-12-07 11:08:12,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:08:12,354 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 11:08:12,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:08:12,454 INFO L225 Difference]: With dead ends: 53078 [2019-12-07 11:08:12,454 INFO L226 Difference]: Without dead ends: 53078 [2019-12-07 11:08:12,455 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 11:08:13,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53078 states. [2019-12-07 11:08:13,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53078 to 47600. [2019-12-07 11:08:13,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47600 states. [2019-12-07 11:08:13,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47600 states to 47600 states and 161707 transitions. [2019-12-07 11:08:13,612 INFO L78 Accepts]: Start accepts. Automaton has 47600 states and 161707 transitions. Word has length 11 [2019-12-07 11:08:13,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:08:13,612 INFO L462 AbstractCegarLoop]: Abstraction has 47600 states and 161707 transitions. [2019-12-07 11:08:13,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:08:13,613 INFO L276 IsEmpty]: Start isEmpty. Operand 47600 states and 161707 transitions. [2019-12-07 11:08:13,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 11:08:13,617 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:08:13,617 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:08:13,617 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:08:13,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:08:13,617 INFO L82 PathProgramCache]: Analyzing trace with hash -710819149, now seen corresponding path program 1 times [2019-12-07 11:08:13,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:08:13,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170392764] [2019-12-07 11:08:13,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:08:13,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:08:13,673 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 11:08:13,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170392764] [2019-12-07 11:08:13,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:08:13,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:08:13,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887753400] [2019-12-07 11:08:13,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:08:13,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:08:13,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:08:13,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:08:13,675 INFO L87 Difference]: Start difference. First operand 47600 states and 161707 transitions. Second operand 5 states. [2019-12-07 11:08:14,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:08:14,402 INFO L93 Difference]: Finished difference Result 63010 states and 210076 transitions. [2019-12-07 11:08:14,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 11:08:14,402 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-07 11:08:14,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:08:14,498 INFO L225 Difference]: With dead ends: 63010 [2019-12-07 11:08:14,499 INFO L226 Difference]: Without dead ends: 63003 [2019-12-07 11:08:14,499 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:08:15,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63003 states. [2019-12-07 11:08:15,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63003 to 47611. [2019-12-07 11:08:15,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47611 states. [2019-12-07 11:08:15,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47611 states to 47611 states and 161609 transitions. [2019-12-07 11:08:15,711 INFO L78 Accepts]: Start accepts. Automaton has 47611 states and 161609 transitions. Word has length 17 [2019-12-07 11:08:15,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:08:15,712 INFO L462 AbstractCegarLoop]: Abstraction has 47611 states and 161609 transitions. [2019-12-07 11:08:15,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:08:15,712 INFO L276 IsEmpty]: Start isEmpty. Operand 47611 states and 161609 transitions. [2019-12-07 11:08:15,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 11:08:15,727 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:08:15,727 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:08:15,727 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:08:15,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:08:15,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1473983183, now seen corresponding path program 1 times [2019-12-07 11:08:15,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:08:15,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477722067] [2019-12-07 11:08:15,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:08:15,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:08:15,772 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 11:08:15,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477722067] [2019-12-07 11:08:15,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:08:15,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:08:15,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078316637] [2019-12-07 11:08:15,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:08:15,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:08:15,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:08:15,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:08:15,773 INFO L87 Difference]: Start difference. First operand 47611 states and 161609 transitions. Second operand 4 states. [2019-12-07 11:08:15,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:08:15,801 INFO L93 Difference]: Finished difference Result 5620 states and 14074 transitions. [2019-12-07 11:08:15,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:08:15,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-07 11:08:15,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:08:15,805 INFO L225 Difference]: With dead ends: 5620 [2019-12-07 11:08:15,805 INFO L226 Difference]: Without dead ends: 4725 [2019-12-07 11:08:15,805 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 11:08:15,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4725 states. [2019-12-07 11:08:15,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4725 to 4725. [2019-12-07 11:08:15,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4725 states. [2019-12-07 11:08:15,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4725 states to 4725 states and 11319 transitions. [2019-12-07 11:08:15,852 INFO L78 Accepts]: Start accepts. Automaton has 4725 states and 11319 transitions. Word has length 25 [2019-12-07 11:08:15,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:08:15,852 INFO L462 AbstractCegarLoop]: Abstraction has 4725 states and 11319 transitions. [2019-12-07 11:08:15,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:08:15,852 INFO L276 IsEmpty]: Start isEmpty. Operand 4725 states and 11319 transitions. [2019-12-07 11:08:15,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 11:08:15,855 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:08:15,855 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 11:08:15,855 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:08:15,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:08:15,855 INFO L82 PathProgramCache]: Analyzing trace with hash 14742150, now seen corresponding path program 1 times [2019-12-07 11:08:15,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:08:15,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813617081] [2019-12-07 11:08:15,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:08:15,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:08:15,917 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 11:08:15,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813617081] [2019-12-07 11:08:15,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:08:15,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:08:15,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247361790] [2019-12-07 11:08:15,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:08:15,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:08:15,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:08:15,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:08:15,918 INFO L87 Difference]: Start difference. First operand 4725 states and 11319 transitions. Second operand 5 states. [2019-12-07 11:08:15,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:08:15,947 INFO L93 Difference]: Finished difference Result 1095 states and 2326 transitions. [2019-12-07 11:08:15,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:08:15,947 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-07 11:08:15,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:08:15,948 INFO L225 Difference]: With dead ends: 1095 [2019-12-07 11:08:15,948 INFO L226 Difference]: Without dead ends: 991 [2019-12-07 11:08:15,948 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 11:08:15,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2019-12-07 11:08:15,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 949. [2019-12-07 11:08:15,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 949 states. [2019-12-07 11:08:15,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 2023 transitions. [2019-12-07 11:08:15,957 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 2023 transitions. Word has length 37 [2019-12-07 11:08:15,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:08:15,957 INFO L462 AbstractCegarLoop]: Abstraction has 949 states and 2023 transitions. [2019-12-07 11:08:15,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:08:15,957 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 2023 transitions. [2019-12-07 11:08:15,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-07 11:08:15,959 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:08:15,959 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:08:15,959 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:08:15,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:08:15,959 INFO L82 PathProgramCache]: Analyzing trace with hash -436222142, now seen corresponding path program 1 times [2019-12-07 11:08:15,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:08:15,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850351156] [2019-12-07 11:08:15,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:08:15,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:08:16,031 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 11:08:16,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850351156] [2019-12-07 11:08:16,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:08:16,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 11:08:16,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190736214] [2019-12-07 11:08:16,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:08:16,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:08:16,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:08:16,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:08:16,033 INFO L87 Difference]: Start difference. First operand 949 states and 2023 transitions. Second operand 6 states. [2019-12-07 11:08:16,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:08:16,374 INFO L93 Difference]: Finished difference Result 1405 states and 2968 transitions. [2019-12-07 11:08:16,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 11:08:16,374 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-07 11:08:16,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:08:16,375 INFO L225 Difference]: With dead ends: 1405 [2019-12-07 11:08:16,375 INFO L226 Difference]: Without dead ends: 1405 [2019-12-07 11:08:16,375 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:08:16,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2019-12-07 11:08:16,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 1132. [2019-12-07 11:08:16,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1132 states. [2019-12-07 11:08:16,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 2413 transitions. [2019-12-07 11:08:16,385 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 2413 transitions. Word has length 68 [2019-12-07 11:08:16,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:08:16,385 INFO L462 AbstractCegarLoop]: Abstraction has 1132 states and 2413 transitions. [2019-12-07 11:08:16,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:08:16,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 2413 transitions. [2019-12-07 11:08:16,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-07 11:08:16,386 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:08:16,387 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:08:16,387 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:08:16,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:08:16,387 INFO L82 PathProgramCache]: Analyzing trace with hash 859631310, now seen corresponding path program 2 times [2019-12-07 11:08:16,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:08:16,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485625146] [2019-12-07 11:08:16,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:08:16,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:08:16,439 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 11:08:16,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485625146] [2019-12-07 11:08:16,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:08:16,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:08:16,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356209237] [2019-12-07 11:08:16,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:08:16,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:08:16,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:08:16,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:08:16,441 INFO L87 Difference]: Start difference. First operand 1132 states and 2413 transitions. Second operand 3 states. [2019-12-07 11:08:16,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:08:16,450 INFO L93 Difference]: Finished difference Result 963 states and 2007 transitions. [2019-12-07 11:08:16,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:08:16,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-12-07 11:08:16,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:08:16,451 INFO L225 Difference]: With dead ends: 963 [2019-12-07 11:08:16,451 INFO L226 Difference]: Without dead ends: 963 [2019-12-07 11:08:16,451 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 11:08:16,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2019-12-07 11:08:16,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 963. [2019-12-07 11:08:16,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2019-12-07 11:08:16,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 2007 transitions. [2019-12-07 11:08:16,459 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 2007 transitions. Word has length 68 [2019-12-07 11:08:16,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:08:16,459 INFO L462 AbstractCegarLoop]: Abstraction has 963 states and 2007 transitions. [2019-12-07 11:08:16,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:08:16,459 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 2007 transitions. [2019-12-07 11:08:16,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-07 11:08:16,460 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:08:16,460 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:08:16,460 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:08:16,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:08:16,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1270284952, now seen corresponding path program 1 times [2019-12-07 11:08:16,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:08:16,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55295677] [2019-12-07 11:08:16,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:08:16,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:08:16,522 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 11:08:16,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55295677] [2019-12-07 11:08:16,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:08:16,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:08:16,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391864381] [2019-12-07 11:08:16,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:08:16,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:08:16,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:08:16,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:08:16,523 INFO L87 Difference]: Start difference. First operand 963 states and 2007 transitions. Second operand 5 states. [2019-12-07 11:08:16,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:08:16,673 INFO L93 Difference]: Finished difference Result 1101 states and 2255 transitions. [2019-12-07 11:08:16,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:08:16,674 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-12-07 11:08:16,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:08:16,674 INFO L225 Difference]: With dead ends: 1101 [2019-12-07 11:08:16,675 INFO L226 Difference]: Without dead ends: 1101 [2019-12-07 11:08:16,675 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:08:16,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1101 states. [2019-12-07 11:08:16,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1101 to 1048. [2019-12-07 11:08:16,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048 states. [2019-12-07 11:08:16,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 2161 transitions. [2019-12-07 11:08:16,683 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 2161 transitions. Word has length 69 [2019-12-07 11:08:16,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:08:16,683 INFO L462 AbstractCegarLoop]: Abstraction has 1048 states and 2161 transitions. [2019-12-07 11:08:16,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:08:16,683 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 2161 transitions. [2019-12-07 11:08:16,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-07 11:08:16,684 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:08:16,684 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:08:16,684 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:08:16,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:08:16,685 INFO L82 PathProgramCache]: Analyzing trace with hash 25568500, now seen corresponding path program 2 times [2019-12-07 11:08:16,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:08:16,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267972103] [2019-12-07 11:08:16,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:08:16,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:08:16,790 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 11:08:16,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267972103] [2019-12-07 11:08:16,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:08:16,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 11:08:16,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838169036] [2019-12-07 11:08:16,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 11:08:16,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:08:16,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 11:08:16,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:08:16,791 INFO L87 Difference]: Start difference. First operand 1048 states and 2161 transitions. Second operand 8 states. [2019-12-07 11:08:17,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:08:17,284 INFO L93 Difference]: Finished difference Result 2201 states and 4522 transitions. [2019-12-07 11:08:17,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 11:08:17,284 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 69 [2019-12-07 11:08:17,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:08:17,286 INFO L225 Difference]: With dead ends: 2201 [2019-12-07 11:08:17,286 INFO L226 Difference]: Without dead ends: 2201 [2019-12-07 11:08:17,286 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-12-07 11:08:17,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2201 states. [2019-12-07 11:08:17,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2201 to 1595. [2019-12-07 11:08:17,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1595 states. [2019-12-07 11:08:17,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1595 states and 3328 transitions. [2019-12-07 11:08:17,300 INFO L78 Accepts]: Start accepts. Automaton has 1595 states and 3328 transitions. Word has length 69 [2019-12-07 11:08:17,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:08:17,300 INFO L462 AbstractCegarLoop]: Abstraction has 1595 states and 3328 transitions. [2019-12-07 11:08:17,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 11:08:17,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1595 states and 3328 transitions. [2019-12-07 11:08:17,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-07 11:08:17,302 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:08:17,302 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:08:17,302 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:08:17,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:08:17,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1502663669, now seen corresponding path program 1 times [2019-12-07 11:08:17,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:08:17,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485228581] [2019-12-07 11:08:17,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:08:17,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:08:17,406 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 11:08:17,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485228581] [2019-12-07 11:08:17,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:08:17,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 11:08:17,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563414248] [2019-12-07 11:08:17,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:08:17,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:08:17,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:08:17,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:08:17,407 INFO L87 Difference]: Start difference. First operand 1595 states and 3328 transitions. Second operand 6 states. [2019-12-07 11:08:17,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:08:17,685 INFO L93 Difference]: Finished difference Result 2446 states and 5110 transitions. [2019-12-07 11:08:17,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 11:08:17,686 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-12-07 11:08:17,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:08:17,688 INFO L225 Difference]: With dead ends: 2446 [2019-12-07 11:08:17,688 INFO L226 Difference]: Without dead ends: 2446 [2019-12-07 11:08:17,688 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:08:17,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2446 states. [2019-12-07 11:08:17,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2446 to 1659. [2019-12-07 11:08:17,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1659 states. [2019-12-07 11:08:17,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1659 states and 3468 transitions. [2019-12-07 11:08:17,706 INFO L78 Accepts]: Start accepts. Automaton has 1659 states and 3468 transitions. Word has length 70 [2019-12-07 11:08:17,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:08:17,707 INFO L462 AbstractCegarLoop]: Abstraction has 1659 states and 3468 transitions. [2019-12-07 11:08:17,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:08:17,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 3468 transitions. [2019-12-07 11:08:17,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-07 11:08:17,709 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:08:17,709 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:08:17,709 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:08:17,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:08:17,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1241316174, now seen corresponding path program 1 times [2019-12-07 11:08:17,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:08:17,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995454972] [2019-12-07 11:08:17,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:08:17,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:08:17,753 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 11:08:17,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995454972] [2019-12-07 11:08:17,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:08:17,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:08:17,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132382612] [2019-12-07 11:08:17,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:08:17,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:08:17,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:08:17,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:08:17,754 INFO L87 Difference]: Start difference. First operand 1659 states and 3468 transitions. Second operand 3 states. [2019-12-07 11:08:17,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:08:17,783 INFO L93 Difference]: Finished difference Result 1658 states and 3466 transitions. [2019-12-07 11:08:17,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:08:17,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-12-07 11:08:17,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:08:17,784 INFO L225 Difference]: With dead ends: 1658 [2019-12-07 11:08:17,784 INFO L226 Difference]: Without dead ends: 1658 [2019-12-07 11:08:17,785 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 11:08:17,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1658 states. [2019-12-07 11:08:17,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1658 to 1419. [2019-12-07 11:08:17,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1419 states. [2019-12-07 11:08:17,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 2987 transitions. [2019-12-07 11:08:17,797 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 2987 transitions. Word has length 70 [2019-12-07 11:08:17,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:08:17,798 INFO L462 AbstractCegarLoop]: Abstraction has 1419 states and 2987 transitions. [2019-12-07 11:08:17,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:08:17,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 2987 transitions. [2019-12-07 11:08:17,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-07 11:08:17,799 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:08:17,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, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:08:17,799 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:08:17,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:08:17,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1779301553, now seen corresponding path program 2 times [2019-12-07 11:08:17,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:08:17,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977905555] [2019-12-07 11:08:17,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:08:17,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:08:17,905 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 11:08:17,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977905555] [2019-12-07 11:08:17,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:08:17,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:08:17,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006553269] [2019-12-07 11:08:17,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:08:17,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:08:17,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:08:17,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:08:17,907 INFO L87 Difference]: Start difference. First operand 1419 states and 2987 transitions. Second operand 6 states. [2019-12-07 11:08:18,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:08:18,101 INFO L93 Difference]: Finished difference Result 1505 states and 3137 transitions. [2019-12-07 11:08:18,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 11:08:18,101 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-12-07 11:08:18,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:08:18,102 INFO L225 Difference]: With dead ends: 1505 [2019-12-07 11:08:18,102 INFO L226 Difference]: Without dead ends: 1505 [2019-12-07 11:08:18,102 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 6 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:08:18,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2019-12-07 11:08:18,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1375. [2019-12-07 11:08:18,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1375 states. [2019-12-07 11:08:18,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1375 states and 2859 transitions. [2019-12-07 11:08:18,113 INFO L78 Accepts]: Start accepts. Automaton has 1375 states and 2859 transitions. Word has length 70 [2019-12-07 11:08:18,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:08:18,113 INFO L462 AbstractCegarLoop]: Abstraction has 1375 states and 2859 transitions. [2019-12-07 11:08:18,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:08:18,113 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 2859 transitions. [2019-12-07 11:08:18,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-07 11:08:18,115 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:08:18,115 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:08:18,115 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:08:18,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:08:18,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1388303069, now seen corresponding path program 3 times [2019-12-07 11:08:18,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:08:18,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956741617] [2019-12-07 11:08:18,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:08:18,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:08:18,253 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 11:08:18,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956741617] [2019-12-07 11:08:18,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:08:18,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 11:08:18,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045878176] [2019-12-07 11:08:18,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 11:08:18,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:08:18,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 11:08:18,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:08:18,255 INFO L87 Difference]: Start difference. First operand 1375 states and 2859 transitions. Second operand 7 states. [2019-12-07 11:08:18,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:08:18,457 INFO L93 Difference]: Finished difference Result 1568 states and 3242 transitions. [2019-12-07 11:08:18,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 11:08:18,457 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2019-12-07 11:08:18,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:08:18,458 INFO L225 Difference]: With dead ends: 1568 [2019-12-07 11:08:18,459 INFO L226 Difference]: Without dead ends: 1568 [2019-12-07 11:08:18,459 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:08:18,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1568 states. [2019-12-07 11:08:18,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1568 to 1152. [2019-12-07 11:08:18,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1152 states. [2019-12-07 11:08:18,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 2378 transitions. [2019-12-07 11:08:18,468 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 2378 transitions. Word has length 70 [2019-12-07 11:08:18,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:08:18,468 INFO L462 AbstractCegarLoop]: Abstraction has 1152 states and 2378 transitions. [2019-12-07 11:08:18,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 11:08:18,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 2378 transitions. [2019-12-07 11:08:18,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-07 11:08:18,470 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:08:18,470 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:08:18,470 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:08:18,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:08:18,470 INFO L82 PathProgramCache]: Analyzing trace with hash 53631247, now seen corresponding path program 4 times [2019-12-07 11:08:18,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:08:18,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496149126] [2019-12-07 11:08:18,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:08:18,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:08:18,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:08:18,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496149126] [2019-12-07 11:08:18,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:08:18,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 11:08:18,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554735842] [2019-12-07 11:08:18,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 11:08:18,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:08:18,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 11:08:18,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:08:18,554 INFO L87 Difference]: Start difference. First operand 1152 states and 2378 transitions. Second operand 7 states. [2019-12-07 11:08:18,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:08:18,797 INFO L93 Difference]: Finished difference Result 1371 states and 2802 transitions. [2019-12-07 11:08:18,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 11:08:18,797 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2019-12-07 11:08:18,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:08:18,798 INFO L225 Difference]: With dead ends: 1371 [2019-12-07 11:08:18,798 INFO L226 Difference]: Without dead ends: 1371 [2019-12-07 11:08:18,799 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-12-07 11:08:18,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2019-12-07 11:08:18,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1096. [2019-12-07 11:08:18,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1096 states. [2019-12-07 11:08:18,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1096 states to 1096 states and 2261 transitions. [2019-12-07 11:08:18,808 INFO L78 Accepts]: Start accepts. Automaton has 1096 states and 2261 transitions. Word has length 70 [2019-12-07 11:08:18,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:08:18,808 INFO L462 AbstractCegarLoop]: Abstraction has 1096 states and 2261 transitions. [2019-12-07 11:08:18,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 11:08:18,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1096 states and 2261 transitions. [2019-12-07 11:08:18,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 11:08:18,809 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:08:18,809 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:08:18,809 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:08:18,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:08:18,810 INFO L82 PathProgramCache]: Analyzing trace with hash -2069710509, now seen corresponding path program 1 times [2019-12-07 11:08:18,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:08:18,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545789783] [2019-12-07 11:08:18,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:08:18,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:08:18,984 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 11:08:18,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545789783] [2019-12-07 11:08:18,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:08:18,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 11:08:18,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513597679] [2019-12-07 11:08:18,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 11:08:18,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:08:18,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 11:08:18,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-07 11:08:18,985 INFO L87 Difference]: Start difference. First operand 1096 states and 2261 transitions. Second operand 12 states. [2019-12-07 11:08:19,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:08:19,440 INFO L93 Difference]: Finished difference Result 2326 states and 4725 transitions. [2019-12-07 11:08:19,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 11:08:19,440 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 71 [2019-12-07 11:08:19,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:08:19,441 INFO L225 Difference]: With dead ends: 2326 [2019-12-07 11:08:19,441 INFO L226 Difference]: Without dead ends: 248 [2019-12-07 11:08:19,441 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=354, Unknown=0, NotChecked=0, Total=506 [2019-12-07 11:08:19,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-12-07 11:08:19,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 224. [2019-12-07 11:08:19,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-12-07 11:08:19,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 377 transitions. [2019-12-07 11:08:19,443 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 377 transitions. Word has length 71 [2019-12-07 11:08:19,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:08:19,443 INFO L462 AbstractCegarLoop]: Abstraction has 224 states and 377 transitions. [2019-12-07 11:08:19,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 11:08:19,443 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 377 transitions. [2019-12-07 11:08:19,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 11:08:19,444 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:08:19,444 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:08:19,444 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:08:19,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:08:19,444 INFO L82 PathProgramCache]: Analyzing trace with hash 915841789, now seen corresponding path program 2 times [2019-12-07 11:08:19,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:08:19,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558468951] [2019-12-07 11:08:19,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:08:19,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:08:19,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:08:19,527 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:08:19,527 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 11:08:19,530 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_52| 0 0))) (and (= v_~x$r_buff1_thd1~0_179 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t597~0.base_29| 4)) (= v_~weak$$choice2~0_240 0) (= v_~main$tmp_guard0~0_30 0) (= 0 v_~x$mem_tmp~0_174) (= 0 v_~x~0_313) (= v_~x$r_buff1_thd0~0_357 0) (= v_~__unbuffered_p1_EBX~0_40 0) (= 0 v_~x$w_buff0_used~0_865) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t597~0.base_29|)) (= 0 v_~x$read_delayed_var~0.base_7) (< 0 |v_#StackHeapBarrier_15|) (= v_~y~0_29 0) (= 0 v_~x$read_delayed~0_6) (= 0 v_~x$w_buff0~0_223) (= 0 v_~x$r_buff0_thd2~0_470) (= 0 v_~x$w_buff1_used~0_522) (= 0 v_~__unbuffered_p1_EAX~0_63) (= v_~x$r_buff0_thd0~0_374 0) (= |v_#NULL.offset_5| 0) (= 0 v_~x$r_buff1_thd2~0_352) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t597~0.base_29| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t597~0.base_29|) |v_ULTIMATE.start_main_~#t597~0.offset_21| 0)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t597~0.base_29|) (= 0 v_~x$r_buff0_thd1~0_99) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~__unbuffered_cnt~0_43) (= |v_ULTIMATE.start_main_~#t597~0.offset_21| 0) (= 0 v_~x$w_buff1~0_209) (= v_~x$flush_delayed~0_235 0) (= |v_#valid_50| (store .cse0 |v_ULTIMATE.start_main_~#t597~0.base_29| 1)) (= 0 |v_#NULL.base_5|) (= 0 v_~weak$$choice0~0_159) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_52|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_223, ~x$flush_delayed~0=v_~x$flush_delayed~0_235, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_123|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_80|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_179, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_113|, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_55|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_69|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_35|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_52|, ULTIMATE.start_main_~#t597~0.base=|v_ULTIMATE.start_main_~#t597~0.base_29|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_59|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_63, #length=|v_#length_19|, ULTIMATE.start_main_~#t597~0.offset=|v_ULTIMATE.start_main_~#t597~0.offset_21|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_374, ULTIMATE.start_main_#t~nondet47=|v_ULTIMATE.start_main_#t~nondet47_57|, ~x$w_buff1~0=v_~x$w_buff1~0_209, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_42|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_522, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_352, ULTIMATE.start_main_#t~ite54=|v_ULTIMATE.start_main_#t~ite54_65|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_36|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_33|, ~weak$$choice0~0=v_~weak$$choice0~0_159, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_49|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_93|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, ULTIMATE.start_main_~#t598~0.base=|v_ULTIMATE.start_main_~#t598~0.base_29|, ~x~0=v_~x~0_313, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_99, ULTIMATE.start_main_~#t598~0.offset=|v_ULTIMATE.start_main_~#t598~0.offset_21|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_69|, ~x$mem_tmp~0=v_~x$mem_tmp~0_174, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_141|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_42|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_27|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_50|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_61|, ~y~0=v_~y~0_29, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_57|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_40|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_105|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_357, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_470, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_62|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_95|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_865, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_30|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_152|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_45|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_20|, ~weak$$choice2~0=v_~weak$$choice2~0_240, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite68, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_~#t597~0.base, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p1_EAX~0, #length, ULTIMATE.start_main_~#t597~0.offset, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet47, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite58, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_#t~ite56, ~x$read_delayed_var~0.base, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t598~0.base, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t598~0.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite65, ULTIMATE.start_main_#t~ite51, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite53, #NULL.base, ULTIMATE.start_main_#t~ite55, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite60, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 11:08:19,530 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L797-1-->L799: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t598~0.base_13|) (= |v_#valid_26| (store |v_#valid_27| |v_ULTIMATE.start_main_~#t598~0.base_13| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t598~0.base_13|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t598~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t598~0.base_13|) |v_ULTIMATE.start_main_~#t598~0.offset_11| 1))) (= 0 (select |v_#valid_27| |v_ULTIMATE.start_main_~#t598~0.base_13|)) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t598~0.base_13| 4)) (= |v_ULTIMATE.start_main_~#t598~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, ULTIMATE.start_main_~#t598~0.offset=|v_ULTIMATE.start_main_~#t598~0.offset_11|, #length=|v_#length_11|, ULTIMATE.start_main_~#t598~0.base=|v_ULTIMATE.start_main_~#t598~0.base_13|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t598~0.offset, #length, ULTIMATE.start_main_~#t598~0.base] because there is no mapped edge [2019-12-07 11:08:19,531 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] P1ENTRY-->L4-3: Formula: (and (= v_~x$w_buff1_used~0_77 v_~x$w_buff0_used~0_156) (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_7|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_7| v_P1Thread1of1ForFork1_~arg.offset_5) (not (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 0)) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|) (= 2 v_~x$w_buff0~0_34) (= (ite (not (and (not (= 0 (mod v_~x$w_buff0_used~0_155 256))) (not (= 0 (mod v_~x$w_buff1_used~0_77 256))))) 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|) (= 1 v_~x$w_buff0_used~0_155) (= v_~x$w_buff0~0_35 v_~x$w_buff1~0_28)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_156} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7, ~x$w_buff0~0=v_~x$w_buff0~0_34, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, ~x$w_buff1~0=v_~x$w_buff1~0_28, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_77, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_155} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-07 11:08:19,531 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L759-2-->L759-5: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In1391980924 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In1391980924 256) 0)) (.cse0 (= |P1Thread1of1ForFork1_#t~ite11_Out1391980924| |P1Thread1of1ForFork1_#t~ite12_Out1391980924|))) (or (and .cse0 (not .cse1) (not .cse2) (= |P1Thread1of1ForFork1_#t~ite11_Out1391980924| ~x$w_buff0~0_In1391980924)) (and (or .cse2 .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out1391980924| ~x$w_buff1~0_In1391980924) .cse0))) InVars {~x$w_buff0~0=~x$w_buff0~0_In1391980924, ~x$w_buff1~0=~x$w_buff1~0_In1391980924, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1391980924, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1391980924} OutVars{~x$w_buff0~0=~x$w_buff0~0_In1391980924, ~x$w_buff1~0=~x$w_buff1~0_In1391980924, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1391980924|, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1391980924|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1391980924, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1391980924} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11, P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 11:08:19,533 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] L764-->L765: Formula: (and (= v_~x$r_buff0_thd2~0_138 v_~x$r_buff0_thd2~0_137) (not (= 0 (mod v_~weak$$choice2~0_59 256)))) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_138, ~weak$$choice2~0=v_~weak$$choice2~0_59} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_137, ~weak$$choice2~0=v_~weak$$choice2~0_59, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_15|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 11:08:19,534 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [945] [945] L767-->L767-2: Formula: (let ((.cse0 (= (mod ~x$flush_delayed~0_In1390752777 256) 0))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite31_Out1390752777| ~x~0_In1390752777)) (and (= ~x$mem_tmp~0_In1390752777 |P1Thread1of1ForFork1_#t~ite31_Out1390752777|) (not .cse0)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In1390752777, ~x$mem_tmp~0=~x$mem_tmp~0_In1390752777, ~x~0=~x~0_In1390752777} OutVars{~x$flush_delayed~0=~x$flush_delayed~0_In1390752777, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out1390752777|, ~x$mem_tmp~0=~x$mem_tmp~0_In1390752777, ~x~0=~x~0_In1390752777} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 11:08:19,535 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [947] [947] L730-2-->L730-5: Formula: (let ((.cse1 (= |P0Thread1of1ForFork0_#t~ite4_Out170571138| |P0Thread1of1ForFork0_#t~ite3_Out170571138|)) (.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In170571138 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In170571138 256) 0))) (or (and (not .cse0) .cse1 (= |P0Thread1of1ForFork0_#t~ite3_Out170571138| ~x$w_buff1~0_In170571138) (not .cse2)) (and (= |P0Thread1of1ForFork0_#t~ite3_Out170571138| ~x~0_In170571138) .cse1 (or .cse0 .cse2)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In170571138, ~x$w_buff1_used~0=~x$w_buff1_used~0_In170571138, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In170571138, ~x~0=~x~0_In170571138} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out170571138|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out170571138|, ~x$w_buff1~0=~x$w_buff1~0_In170571138, ~x$w_buff1_used~0=~x$w_buff1_used~0_In170571138, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In170571138, ~x~0=~x~0_In170571138} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-07 11:08:19,535 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [924] [924] L731-->L731-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In241761183 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In241761183 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In241761183 |P0Thread1of1ForFork0_#t~ite5_Out241761183|)) (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out241761183|) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In241761183, ~x$w_buff0_used~0=~x$w_buff0_used~0_In241761183} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out241761183|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In241761183, ~x$w_buff0_used~0=~x$w_buff0_used~0_In241761183} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 11:08:19,536 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [930] [930] L775-->L775-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-2143852365 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-2143852365 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-2143852365|) (not .cse1)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-2143852365 |P1Thread1of1ForFork1_#t~ite34_Out-2143852365|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2143852365, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2143852365} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-2143852365|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2143852365, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2143852365} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 11:08:19,536 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [938] [938] L776-->L776-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In-1686351630 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd2~0_In-1686351630 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1686351630 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1686351630 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite35_Out-1686351630| ~x$w_buff1_used~0_In-1686351630)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out-1686351630| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1686351630, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1686351630, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1686351630, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1686351630} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1686351630, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1686351630, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1686351630|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1686351630, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1686351630} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 11:08:19,536 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L777-->L778: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1672611739 256))) (.cse1 (= ~x$r_buff0_thd2~0_In1672611739 ~x$r_buff0_thd2~0_Out1672611739)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In1672611739 256) 0))) (or (and .cse0 .cse1) (and (not .cse0) (not .cse2) (= 0 ~x$r_buff0_thd2~0_Out1672611739)) (and .cse1 .cse2))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1672611739, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1672611739} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1672611739, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1672611739|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1672611739} AuxVars[] AssignedVars[~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 11:08:19,536 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [936] [936] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd2~0_In-392242830 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-392242830 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In-392242830 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-392242830 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite37_Out-392242830| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite37_Out-392242830| ~x$r_buff1_thd2~0_In-392242830)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-392242830, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-392242830, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-392242830, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-392242830} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-392242830, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-392242830, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-392242830, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-392242830|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-392242830} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 11:08:19,536 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [968] [968] L778-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_22 1) v_~__unbuffered_cnt~0_21) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~x$r_buff1_thd2~0_154 |v_P1Thread1of1ForFork1_#t~ite37_20|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_20|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_154, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_19|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 11:08:19,537 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L732-->L732-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd1~0_In-2068309338 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-2068309338 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-2068309338 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-2068309338 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-2068309338| 0)) (and (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite6_Out-2068309338| ~x$w_buff1_used~0_In-2068309338) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2068309338, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2068309338, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2068309338, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2068309338} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-2068309338|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2068309338, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2068309338, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2068309338, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2068309338} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 11:08:19,537 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L733-->L733-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In110833195 256))) (.cse0 (= (mod ~x$r_buff0_thd1~0_In110833195 256) 0))) (or (and (= ~x$r_buff0_thd1~0_In110833195 |P0Thread1of1ForFork0_#t~ite7_Out110833195|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite7_Out110833195|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In110833195, ~x$w_buff0_used~0=~x$w_buff0_used~0_In110833195} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In110833195, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out110833195|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In110833195} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-07 11:08:19,537 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [933] [933] L734-->L734-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1273013998 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1273013998 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1273013998 256))) (.cse2 (= (mod ~x$r_buff1_thd1~0_In-1273013998 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out-1273013998| ~x$r_buff1_thd1~0_In-1273013998)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-1273013998|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1273013998, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1273013998, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1273013998, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1273013998} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1273013998, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1273013998|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1273013998, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1273013998, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1273013998} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 11:08:19,537 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L734-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_140 |v_P0Thread1of1ForFork0_#t~ite8_24|) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_24|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_23|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_140} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-07 11:08:19,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [857] [857] L803-->L805-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= 0 (mod v_~x$r_buff0_thd0~0_54 256)) (= 0 (mod v_~x$w_buff0_used~0_123 256)))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_54, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_123} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_54, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_123} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 11:08:19,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [929] [929] L805-2-->L805-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd0~0_In-2013935993 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-2013935993 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out-2013935993| ~x~0_In-2013935993) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In-2013935993 |ULTIMATE.start_main_#t~ite40_Out-2013935993|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-2013935993, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2013935993, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2013935993, ~x~0=~x~0_In-2013935993} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-2013935993|, ~x$w_buff1~0=~x$w_buff1~0_In-2013935993, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2013935993, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2013935993, ~x~0=~x~0_In-2013935993} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 11:08:19,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [894] [894] L805-4-->L806: Formula: (= v_~x~0_51 |v_ULTIMATE.start_main_#t~ite40_11|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~x~0=v_~x~0_51} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x~0] because there is no mapped edge [2019-12-07 11:08:19,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [925] [925] L806-->L806-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-2137781671 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-2137781671 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out-2137781671| 0)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-2137781671 |ULTIMATE.start_main_#t~ite42_Out-2137781671|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2137781671, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2137781671} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2137781671, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-2137781671|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2137781671} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 11:08:19,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [926] [926] L807-->L807-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In-1580454202 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In-1580454202 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1580454202 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-1580454202 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-1580454202| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out-1580454202| ~x$w_buff1_used~0_In-1580454202)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1580454202, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1580454202, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1580454202, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1580454202} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1580454202, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1580454202, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1580454202|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1580454202, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1580454202} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 11:08:19,539 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [940] [940] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-25068524 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-25068524 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-25068524| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd0~0_In-25068524 |ULTIMATE.start_main_#t~ite44_Out-25068524|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-25068524, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-25068524} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-25068524, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-25068524|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-25068524} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 11:08:19,539 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L809-->L809-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In1573639319 256))) (.cse2 (= (mod ~x$r_buff0_thd0~0_In1573639319 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd0~0_In1573639319 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In1573639319 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out1573639319| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out1573639319| ~x$r_buff1_thd0~0_In1573639319)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1573639319, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1573639319, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1573639319, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1573639319} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1573639319, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1573639319, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1573639319, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1573639319|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1573639319} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 11:08:19,542 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [941] [941] L824-->L824-2: Formula: (let ((.cse0 (= (mod ~x$flush_delayed~0_In1658894823 256) 0))) (or (and .cse0 (= ~x~0_In1658894823 |ULTIMATE.start_main_#t~ite68_Out1658894823|)) (and (not .cse0) (= ~x$mem_tmp~0_In1658894823 |ULTIMATE.start_main_#t~ite68_Out1658894823|)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In1658894823, ~x$mem_tmp~0=~x$mem_tmp~0_In1658894823, ~x~0=~x~0_In1658894823} OutVars{~x$flush_delayed~0=~x$flush_delayed~0_In1658894823, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out1658894823|, ~x$mem_tmp~0=~x$mem_tmp~0_In1658894823, ~x~0=~x~0_In1658894823} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-07 11:08:19,542 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L824-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~x$flush_delayed~0_193 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= (mod v_~main$tmp_guard1~0_29 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= |v_ULTIMATE.start_main_#t~ite68_38| v_~x~0_259)) InVars {~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_38|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~x$flush_delayed~0=v_~x$flush_delayed~0_193, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_37|, ~x~0=v_~x~0_259, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite68, ~x~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 11:08:19,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:08:19 BasicIcfg [2019-12-07 11:08:19,599 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:08:19,599 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:08:19,599 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:08:19,599 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:08:19,599 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:08:03" (3/4) ... [2019-12-07 11:08:19,601 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 11:08:19,601 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_52| 0 0))) (and (= v_~x$r_buff1_thd1~0_179 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t597~0.base_29| 4)) (= v_~weak$$choice2~0_240 0) (= v_~main$tmp_guard0~0_30 0) (= 0 v_~x$mem_tmp~0_174) (= 0 v_~x~0_313) (= v_~x$r_buff1_thd0~0_357 0) (= v_~__unbuffered_p1_EBX~0_40 0) (= 0 v_~x$w_buff0_used~0_865) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t597~0.base_29|)) (= 0 v_~x$read_delayed_var~0.base_7) (< 0 |v_#StackHeapBarrier_15|) (= v_~y~0_29 0) (= 0 v_~x$read_delayed~0_6) (= 0 v_~x$w_buff0~0_223) (= 0 v_~x$r_buff0_thd2~0_470) (= 0 v_~x$w_buff1_used~0_522) (= 0 v_~__unbuffered_p1_EAX~0_63) (= v_~x$r_buff0_thd0~0_374 0) (= |v_#NULL.offset_5| 0) (= 0 v_~x$r_buff1_thd2~0_352) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t597~0.base_29| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t597~0.base_29|) |v_ULTIMATE.start_main_~#t597~0.offset_21| 0)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t597~0.base_29|) (= 0 v_~x$r_buff0_thd1~0_99) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~__unbuffered_cnt~0_43) (= |v_ULTIMATE.start_main_~#t597~0.offset_21| 0) (= 0 v_~x$w_buff1~0_209) (= v_~x$flush_delayed~0_235 0) (= |v_#valid_50| (store .cse0 |v_ULTIMATE.start_main_~#t597~0.base_29| 1)) (= 0 |v_#NULL.base_5|) (= 0 v_~weak$$choice0~0_159) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_52|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_223, ~x$flush_delayed~0=v_~x$flush_delayed~0_235, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_123|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_80|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_179, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_113|, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_55|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_69|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_35|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_52|, ULTIMATE.start_main_~#t597~0.base=|v_ULTIMATE.start_main_~#t597~0.base_29|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_59|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_63, #length=|v_#length_19|, ULTIMATE.start_main_~#t597~0.offset=|v_ULTIMATE.start_main_~#t597~0.offset_21|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_374, ULTIMATE.start_main_#t~nondet47=|v_ULTIMATE.start_main_#t~nondet47_57|, ~x$w_buff1~0=v_~x$w_buff1~0_209, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_42|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_522, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_352, ULTIMATE.start_main_#t~ite54=|v_ULTIMATE.start_main_#t~ite54_65|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_36|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_33|, ~weak$$choice0~0=v_~weak$$choice0~0_159, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_49|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_93|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, ULTIMATE.start_main_~#t598~0.base=|v_ULTIMATE.start_main_~#t598~0.base_29|, ~x~0=v_~x~0_313, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_99, ULTIMATE.start_main_~#t598~0.offset=|v_ULTIMATE.start_main_~#t598~0.offset_21|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_69|, ~x$mem_tmp~0=v_~x$mem_tmp~0_174, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_141|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_42|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_27|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_50|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_61|, ~y~0=v_~y~0_29, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_57|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_40|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_105|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_357, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_470, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_62|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_95|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_865, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_30|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_152|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_45|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_20|, ~weak$$choice2~0=v_~weak$$choice2~0_240, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite68, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_~#t597~0.base, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p1_EAX~0, #length, ULTIMATE.start_main_~#t597~0.offset, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet47, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite58, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_#t~ite56, ~x$read_delayed_var~0.base, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t598~0.base, ~x~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t598~0.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite65, ULTIMATE.start_main_#t~ite51, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite53, #NULL.base, ULTIMATE.start_main_#t~ite55, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite60, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 11:08:19,602 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L797-1-->L799: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t598~0.base_13|) (= |v_#valid_26| (store |v_#valid_27| |v_ULTIMATE.start_main_~#t598~0.base_13| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t598~0.base_13|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t598~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t598~0.base_13|) |v_ULTIMATE.start_main_~#t598~0.offset_11| 1))) (= 0 (select |v_#valid_27| |v_ULTIMATE.start_main_~#t598~0.base_13|)) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t598~0.base_13| 4)) (= |v_ULTIMATE.start_main_~#t598~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, ULTIMATE.start_main_~#t598~0.offset=|v_ULTIMATE.start_main_~#t598~0.offset_11|, #length=|v_#length_11|, ULTIMATE.start_main_~#t598~0.base=|v_ULTIMATE.start_main_~#t598~0.base_13|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t598~0.offset, #length, ULTIMATE.start_main_~#t598~0.base] because there is no mapped edge [2019-12-07 11:08:19,602 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] P1ENTRY-->L4-3: Formula: (and (= v_~x$w_buff1_used~0_77 v_~x$w_buff0_used~0_156) (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_7|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_7| v_P1Thread1of1ForFork1_~arg.offset_5) (not (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 0)) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|) (= 2 v_~x$w_buff0~0_34) (= (ite (not (and (not (= 0 (mod v_~x$w_buff0_used~0_155 256))) (not (= 0 (mod v_~x$w_buff1_used~0_77 256))))) 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|) (= 1 v_~x$w_buff0_used~0_155) (= v_~x$w_buff0~0_35 v_~x$w_buff1~0_28)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_35, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_156} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7, ~x$w_buff0~0=v_~x$w_buff0~0_34, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, ~x$w_buff1~0=v_~x$w_buff1~0_28, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_7|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_7|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_77, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_155} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-07 11:08:19,603 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L759-2-->L759-5: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In1391980924 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In1391980924 256) 0)) (.cse0 (= |P1Thread1of1ForFork1_#t~ite11_Out1391980924| |P1Thread1of1ForFork1_#t~ite12_Out1391980924|))) (or (and .cse0 (not .cse1) (not .cse2) (= |P1Thread1of1ForFork1_#t~ite11_Out1391980924| ~x$w_buff0~0_In1391980924)) (and (or .cse2 .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out1391980924| ~x$w_buff1~0_In1391980924) .cse0))) InVars {~x$w_buff0~0=~x$w_buff0~0_In1391980924, ~x$w_buff1~0=~x$w_buff1~0_In1391980924, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1391980924, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1391980924} OutVars{~x$w_buff0~0=~x$w_buff0~0_In1391980924, ~x$w_buff1~0=~x$w_buff1~0_In1391980924, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1391980924|, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1391980924|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1391980924, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1391980924} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11, P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 11:08:19,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] L764-->L765: Formula: (and (= v_~x$r_buff0_thd2~0_138 v_~x$r_buff0_thd2~0_137) (not (= 0 (mod v_~weak$$choice2~0_59 256)))) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_138, ~weak$$choice2~0=v_~weak$$choice2~0_59} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_137, ~weak$$choice2~0=v_~weak$$choice2~0_59, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_15|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 11:08:19,605 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [945] [945] L767-->L767-2: Formula: (let ((.cse0 (= (mod ~x$flush_delayed~0_In1390752777 256) 0))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite31_Out1390752777| ~x~0_In1390752777)) (and (= ~x$mem_tmp~0_In1390752777 |P1Thread1of1ForFork1_#t~ite31_Out1390752777|) (not .cse0)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In1390752777, ~x$mem_tmp~0=~x$mem_tmp~0_In1390752777, ~x~0=~x~0_In1390752777} OutVars{~x$flush_delayed~0=~x$flush_delayed~0_In1390752777, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out1390752777|, ~x$mem_tmp~0=~x$mem_tmp~0_In1390752777, ~x~0=~x~0_In1390752777} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 11:08:19,606 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [947] [947] L730-2-->L730-5: Formula: (let ((.cse1 (= |P0Thread1of1ForFork0_#t~ite4_Out170571138| |P0Thread1of1ForFork0_#t~ite3_Out170571138|)) (.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In170571138 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In170571138 256) 0))) (or (and (not .cse0) .cse1 (= |P0Thread1of1ForFork0_#t~ite3_Out170571138| ~x$w_buff1~0_In170571138) (not .cse2)) (and (= |P0Thread1of1ForFork0_#t~ite3_Out170571138| ~x~0_In170571138) .cse1 (or .cse0 .cse2)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In170571138, ~x$w_buff1_used~0=~x$w_buff1_used~0_In170571138, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In170571138, ~x~0=~x~0_In170571138} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out170571138|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out170571138|, ~x$w_buff1~0=~x$w_buff1~0_In170571138, ~x$w_buff1_used~0=~x$w_buff1_used~0_In170571138, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In170571138, ~x~0=~x~0_In170571138} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-07 11:08:19,606 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [924] [924] L731-->L731-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In241761183 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In241761183 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In241761183 |P0Thread1of1ForFork0_#t~ite5_Out241761183|)) (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out241761183|) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In241761183, ~x$w_buff0_used~0=~x$w_buff0_used~0_In241761183} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out241761183|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In241761183, ~x$w_buff0_used~0=~x$w_buff0_used~0_In241761183} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 11:08:19,607 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [930] [930] L775-->L775-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-2143852365 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-2143852365 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-2143852365|) (not .cse1)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-2143852365 |P1Thread1of1ForFork1_#t~ite34_Out-2143852365|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2143852365, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2143852365} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-2143852365|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2143852365, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2143852365} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 11:08:19,607 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [938] [938] L776-->L776-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In-1686351630 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd2~0_In-1686351630 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1686351630 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1686351630 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite35_Out-1686351630| ~x$w_buff1_used~0_In-1686351630)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out-1686351630| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1686351630, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1686351630, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1686351630, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1686351630} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1686351630, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1686351630, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1686351630|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1686351630, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1686351630} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 11:08:19,607 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L777-->L778: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1672611739 256))) (.cse1 (= ~x$r_buff0_thd2~0_In1672611739 ~x$r_buff0_thd2~0_Out1672611739)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In1672611739 256) 0))) (or (and .cse0 .cse1) (and (not .cse0) (not .cse2) (= 0 ~x$r_buff0_thd2~0_Out1672611739)) (and .cse1 .cse2))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1672611739, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1672611739} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1672611739, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1672611739|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1672611739} AuxVars[] AssignedVars[~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 11:08:19,607 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [936] [936] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd2~0_In-392242830 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-392242830 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In-392242830 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-392242830 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite37_Out-392242830| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P1Thread1of1ForFork1_#t~ite37_Out-392242830| ~x$r_buff1_thd2~0_In-392242830)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-392242830, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-392242830, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-392242830, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-392242830} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-392242830, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-392242830, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-392242830, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-392242830|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-392242830} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 11:08:19,608 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [968] [968] L778-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_22 1) v_~__unbuffered_cnt~0_21) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~x$r_buff1_thd2~0_154 |v_P1Thread1of1ForFork1_#t~ite37_20|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_20|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_154, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_19|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 11:08:19,608 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L732-->L732-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd1~0_In-2068309338 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-2068309338 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-2068309338 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-2068309338 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-2068309338| 0)) (and (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite6_Out-2068309338| ~x$w_buff1_used~0_In-2068309338) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2068309338, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2068309338, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2068309338, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2068309338} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-2068309338|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2068309338, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2068309338, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2068309338, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2068309338} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 11:08:19,608 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L733-->L733-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In110833195 256))) (.cse0 (= (mod ~x$r_buff0_thd1~0_In110833195 256) 0))) (or (and (= ~x$r_buff0_thd1~0_In110833195 |P0Thread1of1ForFork0_#t~ite7_Out110833195|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite7_Out110833195|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In110833195, ~x$w_buff0_used~0=~x$w_buff0_used~0_In110833195} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In110833195, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out110833195|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In110833195} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-07 11:08:19,608 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [933] [933] L734-->L734-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1273013998 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1273013998 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1273013998 256))) (.cse2 (= (mod ~x$r_buff1_thd1~0_In-1273013998 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out-1273013998| ~x$r_buff1_thd1~0_In-1273013998)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-1273013998|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1273013998, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1273013998, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1273013998, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1273013998} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1273013998, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1273013998|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1273013998, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1273013998, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1273013998} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 11:08:19,608 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L734-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_140 |v_P0Thread1of1ForFork0_#t~ite8_24|) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_24|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_23|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_140} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-07 11:08:19,609 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [857] [857] L803-->L805-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= 0 (mod v_~x$r_buff0_thd0~0_54 256)) (= 0 (mod v_~x$w_buff0_used~0_123 256)))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_54, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_123} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_54, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_123} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 11:08:19,609 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [929] [929] L805-2-->L805-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd0~0_In-2013935993 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-2013935993 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out-2013935993| ~x~0_In-2013935993) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In-2013935993 |ULTIMATE.start_main_#t~ite40_Out-2013935993|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-2013935993, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2013935993, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2013935993, ~x~0=~x~0_In-2013935993} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-2013935993|, ~x$w_buff1~0=~x$w_buff1~0_In-2013935993, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2013935993, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2013935993, ~x~0=~x~0_In-2013935993} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 11:08:19,609 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [894] [894] L805-4-->L806: Formula: (= v_~x~0_51 |v_ULTIMATE.start_main_#t~ite40_11|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~x~0=v_~x~0_51} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x~0] because there is no mapped edge [2019-12-07 11:08:19,609 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [925] [925] L806-->L806-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-2137781671 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-2137781671 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out-2137781671| 0)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-2137781671 |ULTIMATE.start_main_#t~ite42_Out-2137781671|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2137781671, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2137781671} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2137781671, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-2137781671|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2137781671} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 11:08:19,609 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [926] [926] L807-->L807-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In-1580454202 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In-1580454202 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1580454202 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-1580454202 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-1580454202| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out-1580454202| ~x$w_buff1_used~0_In-1580454202)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1580454202, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1580454202, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1580454202, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1580454202} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1580454202, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1580454202, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1580454202|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1580454202, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1580454202} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 11:08:19,610 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [940] [940] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-25068524 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-25068524 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-25068524| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd0~0_In-25068524 |ULTIMATE.start_main_#t~ite44_Out-25068524|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-25068524, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-25068524} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-25068524, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-25068524|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-25068524} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 11:08:19,610 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L809-->L809-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In1573639319 256))) (.cse2 (= (mod ~x$r_buff0_thd0~0_In1573639319 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd0~0_In1573639319 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In1573639319 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out1573639319| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out1573639319| ~x$r_buff1_thd0~0_In1573639319)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1573639319, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1573639319, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1573639319, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1573639319} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1573639319, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1573639319, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1573639319, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1573639319|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1573639319} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 11:08:19,613 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [941] [941] L824-->L824-2: Formula: (let ((.cse0 (= (mod ~x$flush_delayed~0_In1658894823 256) 0))) (or (and .cse0 (= ~x~0_In1658894823 |ULTIMATE.start_main_#t~ite68_Out1658894823|)) (and (not .cse0) (= ~x$mem_tmp~0_In1658894823 |ULTIMATE.start_main_#t~ite68_Out1658894823|)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In1658894823, ~x$mem_tmp~0=~x$mem_tmp~0_In1658894823, ~x~0=~x~0_In1658894823} OutVars{~x$flush_delayed~0=~x$flush_delayed~0_In1658894823, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out1658894823|, ~x$mem_tmp~0=~x$mem_tmp~0_In1658894823, ~x~0=~x~0_In1658894823} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-07 11:08:19,613 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L824-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~x$flush_delayed~0_193 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= (mod v_~main$tmp_guard1~0_29 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= |v_ULTIMATE.start_main_#t~ite68_38| v_~x~0_259)) InVars {~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_38|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~x$flush_delayed~0=v_~x$flush_delayed~0_193, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_37|, ~x~0=v_~x~0_259, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite68, ~x~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 11:08:19,674 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_fa8e2214-d371-4faf-8edc-4cf4feb9ffc3/bin/uautomizer/witness.graphml [2019-12-07 11:08:19,674 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:08:19,676 INFO L168 Benchmark]: Toolchain (without parser) took 16605.50 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.0 GB). Free memory was 939.3 MB in the beginning and 1.3 GB in the end (delta: -332.4 MB). Peak memory consumption was 700.5 MB. Max. memory is 11.5 GB. [2019-12-07 11:08:19,676 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:08:19,676 INFO L168 Benchmark]: CACSL2BoogieTranslator took 385.23 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 86.0 MB). Free memory was 939.3 MB in the beginning and 1.0 GB in the end (delta: -108.9 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 11:08:19,676 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.36 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:08:19,676 INFO L168 Benchmark]: Boogie Preprocessor took 28.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:08:19,677 INFO L168 Benchmark]: RCFGBuilder took 455.59 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 980.2 MB in the end (delta: 62.7 MB). Peak memory consumption was 62.7 MB. Max. memory is 11.5 GB. [2019-12-07 11:08:19,677 INFO L168 Benchmark]: TraceAbstraction took 15611.60 ms. Allocated memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: 946.9 MB). Free memory was 980.2 MB in the beginning and 1.3 GB in the end (delta: -317.2 MB). Peak memory consumption was 629.7 MB. Max. memory is 11.5 GB. [2019-12-07 11:08:19,677 INFO L168 Benchmark]: Witness Printer took 75.74 ms. Allocated memory is still 2.1 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2019-12-07 11:08:19,679 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 385.23 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 86.0 MB). Free memory was 939.3 MB in the beginning and 1.0 GB in the end (delta: -108.9 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.36 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 455.59 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 980.2 MB in the end (delta: 62.7 MB). Peak memory consumption was 62.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15611.60 ms. Allocated memory was 1.1 GB in the beginning and 2.1 GB in the end (delta: 946.9 MB). Free memory was 980.2 MB in the beginning and 1.3 GB in the end (delta: -317.2 MB). Peak memory consumption was 629.7 MB. Max. memory is 11.5 GB. * Witness Printer took 75.74 ms. Allocated memory is still 2.1 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.3s, 189 ProgramPointsBefore, 112 ProgramPointsAfterwards, 244 TransitionsBefore, 137 TransitionsAfterwards, 25246 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 53 ConcurrentYvCompositions, 33 ChoiceCompositions, 10285 VarBasedMoverChecksPositive, 306 VarBasedMoverChecksNegative, 77 SemBasedMoverChecksPositive, 331 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.9s, 0 MoverChecksTotal, 142941 CheckedPairsTotal, 118 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t597, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L799] FCALL, FORK 0 pthread_create(&t598, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L749] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L750] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L751] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L752] 2 x$r_buff0_thd2 = (_Bool)1 [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 x$flush_delayed = weak$$choice2 [L758] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L759] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L759] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L760] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L760] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L761] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L761] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L762] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L762] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L763] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L763] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L765] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L765] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L766] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L767] 2 x = x$flush_delayed ? x$mem_tmp : x [L768] 2 x$flush_delayed = (_Bool)0 [L771] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L724] 1 y = 1 [L727] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L730] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L730] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L774] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L731] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L774] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L775] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L776] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L732] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L733] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L806] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L807] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L808] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L809] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L812] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 0 x$flush_delayed = weak$$choice2 [L815] 0 x$mem_tmp = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L816] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L816] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L817] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L817] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L818] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L818] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L819] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L819] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L820] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L820] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L821] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L821] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L822] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L822] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L823] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 183 locations, 2 error locations. Result: UNSAFE, OverallTime: 15.4s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3245 SDtfs, 3538 SDslu, 6414 SDs, 0 SdLazy, 3941 SolverSat, 182 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 154 GetRequests, 26 SyntacticMatches, 30 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47611occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.6s AutomataMinimizationTime, 16 MinimizatonAttempts, 25028 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 872 NumberOfCodeBlocks, 872 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 785 ConstructedInterpolants, 0 QuantifiedInterpolants, 129477 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...