./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix022_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_49c604a2-b1a3-48f5-8b7d-c3f13e300bc5/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_49c604a2-b1a3-48f5-8b7d-c3f13e300bc5/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_49c604a2-b1a3-48f5-8b7d-c3f13e300bc5/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_49c604a2-b1a3-48f5-8b7d-c3f13e300bc5/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix022_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_49c604a2-b1a3-48f5-8b7d-c3f13e300bc5/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_49c604a2-b1a3-48f5-8b7d-c3f13e300bc5/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 4d0b0eaddd6a0bfe3ffef00bcb44c52222c79f40 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:32:50,488 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:32:50,489 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:32:50,499 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:32:50,499 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:32:50,500 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:32:50,501 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:32:50,502 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:32:50,504 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:32:50,505 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:32:50,506 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:32:50,507 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:32:50,507 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:32:50,508 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:32:50,509 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:32:50,510 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:32:50,511 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:32:50,511 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:32:50,513 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:32:50,515 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:32:50,516 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:32:50,517 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:32:50,518 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:32:50,519 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:32:50,521 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:32:50,521 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:32:50,521 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:32:50,522 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:32:50,522 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:32:50,523 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:32:50,523 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:32:50,524 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:32:50,524 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:32:50,525 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:32:50,525 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:32:50,526 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:32:50,526 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:32:50,526 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:32:50,527 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:32:50,527 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:32:50,528 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:32:50,528 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_49c604a2-b1a3-48f5-8b7d-c3f13e300bc5/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 11:32:50,539 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:32:50,539 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:32:50,540 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 11:32:50,540 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 11:32:50,540 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 11:32:50,540 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:32:50,540 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:32:50,540 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:32:50,541 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:32:50,541 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:32:50,541 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 11:32:50,541 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:32:50,541 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 11:32:50,541 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:32:50,541 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:32:50,541 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:32:50,541 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 11:32:50,542 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:32:50,542 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 11:32:50,542 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:32:50,542 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:32:50,542 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:32:50,542 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:32:50,543 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:32:50,543 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 11:32:50,543 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 11:32:50,543 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:32:50,543 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 11:32:50,543 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:32:50,543 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_49c604a2-b1a3-48f5-8b7d-c3f13e300bc5/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 -> 4d0b0eaddd6a0bfe3ffef00bcb44c52222c79f40 [2019-12-07 11:32:50,654 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:32:50,664 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:32:50,668 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:32:50,669 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:32:50,669 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:32:50,670 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_49c604a2-b1a3-48f5-8b7d-c3f13e300bc5/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix022_rmo.opt.i [2019-12-07 11:32:50,713 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_49c604a2-b1a3-48f5-8b7d-c3f13e300bc5/bin/uautomizer/data/849460c31/87917ae65a974175ae7008e4ea81c842/FLAG5926e6148 [2019-12-07 11:32:51,092 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:32:51,092 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_49c604a2-b1a3-48f5-8b7d-c3f13e300bc5/sv-benchmarks/c/pthread-wmm/mix022_rmo.opt.i [2019-12-07 11:32:51,103 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_49c604a2-b1a3-48f5-8b7d-c3f13e300bc5/bin/uautomizer/data/849460c31/87917ae65a974175ae7008e4ea81c842/FLAG5926e6148 [2019-12-07 11:32:51,112 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_49c604a2-b1a3-48f5-8b7d-c3f13e300bc5/bin/uautomizer/data/849460c31/87917ae65a974175ae7008e4ea81c842 [2019-12-07 11:32:51,114 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:32:51,115 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:32:51,116 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:32:51,116 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:32:51,118 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:32:51,119 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:32:51" (1/1) ... [2019-12-07 11:32:51,120 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@551fb3cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:32:51, skipping insertion in model container [2019-12-07 11:32:51,121 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:32:51" (1/1) ... [2019-12-07 11:32:51,126 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:32:51,155 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:32:51,401 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:32:51,409 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:32:51,453 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:32:51,498 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:32:51,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:32:51 WrapperNode [2019-12-07 11:32:51,499 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:32:51,499 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:32:51,499 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:32:51,500 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:32:51,506 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:32:51" (1/1) ... [2019-12-07 11:32:51,520 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:32:51" (1/1) ... [2019-12-07 11:32:51,542 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:32:51,542 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:32:51,542 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:32:51,542 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:32:51,550 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:32:51" (1/1) ... [2019-12-07 11:32:51,550 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:32:51" (1/1) ... [2019-12-07 11:32:51,553 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:32:51" (1/1) ... [2019-12-07 11:32:51,554 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:32:51" (1/1) ... [2019-12-07 11:32:51,561 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:32:51" (1/1) ... [2019-12-07 11:32:51,564 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:32:51" (1/1) ... [2019-12-07 11:32:51,567 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:32:51" (1/1) ... [2019-12-07 11:32:51,571 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:32:51,571 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:32:51,571 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:32:51,571 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:32:51,572 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:32:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_49c604a2-b1a3-48f5-8b7d-c3f13e300bc5/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:32:51,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 11:32:51,619 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 11:32:51,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 11:32:51,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 11:32:51,620 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 11:32:51,620 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 11:32:51,620 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 11:32:51,620 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 11:32:51,620 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 11:32:51,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:32:51,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:32:51,621 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:32:51,950 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:32:51,950 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 11:32:51,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:32:51 BoogieIcfgContainer [2019-12-07 11:32:51,951 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:32:51,952 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:32:51,952 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:32:51,953 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:32:51,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:32:51" (1/3) ... [2019-12-07 11:32:51,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e03c1c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:32:51, skipping insertion in model container [2019-12-07 11:32:51,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:32:51" (2/3) ... [2019-12-07 11:32:51,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e03c1c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:32:51, skipping insertion in model container [2019-12-07 11:32:51,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:32:51" (3/3) ... [2019-12-07 11:32:51,956 INFO L109 eAbstractionObserver]: Analyzing ICFG mix022_rmo.opt.i [2019-12-07 11:32:51,962 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 11:32:51,962 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:32:51,966 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 11:32:51,967 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 11:32:51,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,990 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,990 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,990 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,990 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,990 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,995 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,995 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:51,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:32:52,017 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 11:32:52,030 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:32:52,030 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 11:32:52,030 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:32:52,031 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:32:52,031 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:32:52,031 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:32:52,031 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:32:52,031 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:32:52,041 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-07 11:32:52,042 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-07 11:32:52,089 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-07 11:32:52,089 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 11:32:52,098 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 562 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 11:32:52,110 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-07 11:32:52,137 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-07 11:32:52,137 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 11:32:52,141 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 562 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 11:32:52,151 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-07 11:32:52,152 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 11:32:54,959 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-07 11:32:55,044 INFO L206 etLargeBlockEncoding]: Checked pairs total: 47763 [2019-12-07 11:32:55,044 INFO L214 etLargeBlockEncoding]: Total number of compositions: 101 [2019-12-07 11:32:55,046 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 87 transitions [2019-12-07 11:32:55,354 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8640 states. [2019-12-07 11:32:55,355 INFO L276 IsEmpty]: Start isEmpty. Operand 8640 states. [2019-12-07 11:32:55,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 11:32:55,359 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:32:55,359 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 11:32:55,360 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:32:55,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:32:55,364 INFO L82 PathProgramCache]: Analyzing trace with hash 789332, now seen corresponding path program 1 times [2019-12-07 11:32:55,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:32:55,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104623995] [2019-12-07 11:32:55,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:32:55,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:32:55,505 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:32:55,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104623995] [2019-12-07 11:32:55,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:32:55,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 11:32:55,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230058696] [2019-12-07 11:32:55,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:32:55,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:32:55,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:32:55,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:32:55,521 INFO L87 Difference]: Start difference. First operand 8640 states. Second operand 3 states. [2019-12-07 11:32:55,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:32:55,710 INFO L93 Difference]: Finished difference Result 8468 states and 27386 transitions. [2019-12-07 11:32:55,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:32:55,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 11:32:55,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:32:55,772 INFO L225 Difference]: With dead ends: 8468 [2019-12-07 11:32:55,773 INFO L226 Difference]: Without dead ends: 7976 [2019-12-07 11:32:55,774 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:32:55,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7976 states. [2019-12-07 11:32:56,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7976 to 7976. [2019-12-07 11:32:56,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7976 states. [2019-12-07 11:32:56,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7976 states to 7976 states and 25749 transitions. [2019-12-07 11:32:56,092 INFO L78 Accepts]: Start accepts. Automaton has 7976 states and 25749 transitions. Word has length 3 [2019-12-07 11:32:56,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:32:56,093 INFO L462 AbstractCegarLoop]: Abstraction has 7976 states and 25749 transitions. [2019-12-07 11:32:56,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:32:56,093 INFO L276 IsEmpty]: Start isEmpty. Operand 7976 states and 25749 transitions. [2019-12-07 11:32:56,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 11:32:56,095 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:32:56,095 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:32:56,095 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:32:56,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:32:56,096 INFO L82 PathProgramCache]: Analyzing trace with hash -374477309, now seen corresponding path program 1 times [2019-12-07 11:32:56,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:32:56,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224069417] [2019-12-07 11:32:56,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:32:56,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:32:56,162 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:32:56,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224069417] [2019-12-07 11:32:56,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:32:56,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:32:56,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809890025] [2019-12-07 11:32:56,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:32:56,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:32:56,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:32:56,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:32:56,164 INFO L87 Difference]: Start difference. First operand 7976 states and 25749 transitions. Second operand 4 states. [2019-12-07 11:32:56,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:32:56,217 INFO L93 Difference]: Finished difference Result 1834 states and 4623 transitions. [2019-12-07 11:32:56,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:32:56,218 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 11:32:56,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:32:56,226 INFO L225 Difference]: With dead ends: 1834 [2019-12-07 11:32:56,227 INFO L226 Difference]: Without dead ends: 1342 [2019-12-07 11:32:56,227 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:32:56,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2019-12-07 11:32:56,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 1342. [2019-12-07 11:32:56,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1342 states. [2019-12-07 11:32:56,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 3045 transitions. [2019-12-07 11:32:56,261 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 3045 transitions. Word has length 11 [2019-12-07 11:32:56,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:32:56,261 INFO L462 AbstractCegarLoop]: Abstraction has 1342 states and 3045 transitions. [2019-12-07 11:32:56,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:32:56,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 3045 transitions. [2019-12-07 11:32:56,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 11:32:56,262 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:32:56,263 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:32:56,263 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:32:56,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:32:56,263 INFO L82 PathProgramCache]: Analyzing trace with hash 56348668, now seen corresponding path program 1 times [2019-12-07 11:32:56,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:32:56,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626794830] [2019-12-07 11:32:56,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:32:56,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:32:56,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:32:56,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626794830] [2019-12-07 11:32:56,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:32:56,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:32:56,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734831579] [2019-12-07 11:32:56,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:32:56,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:32:56,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:32:56,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:32:56,346 INFO L87 Difference]: Start difference. First operand 1342 states and 3045 transitions. Second operand 4 states. [2019-12-07 11:32:56,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:32:56,477 INFO L93 Difference]: Finished difference Result 1673 states and 3729 transitions. [2019-12-07 11:32:56,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:32:56,478 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 11:32:56,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:32:56,487 INFO L225 Difference]: With dead ends: 1673 [2019-12-07 11:32:56,488 INFO L226 Difference]: Without dead ends: 1673 [2019-12-07 11:32:56,488 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:32:56,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1673 states. [2019-12-07 11:32:56,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1673 to 1609. [2019-12-07 11:32:56,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1609 states. [2019-12-07 11:32:56,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 3605 transitions. [2019-12-07 11:32:56,545 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 3605 transitions. Word has length 14 [2019-12-07 11:32:56,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:32:56,546 INFO L462 AbstractCegarLoop]: Abstraction has 1609 states and 3605 transitions. [2019-12-07 11:32:56,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:32:56,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 3605 transitions. [2019-12-07 11:32:56,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 11:32:56,549 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:32:56,549 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:32:56,549 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:32:56,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:32:56,549 INFO L82 PathProgramCache]: Analyzing trace with hash -139254967, now seen corresponding path program 1 times [2019-12-07 11:32:56,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:32:56,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613657272] [2019-12-07 11:32:56,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:32:56,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:32:56,657 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:32:56,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613657272] [2019-12-07 11:32:56,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:32:56,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:32:56,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550569385] [2019-12-07 11:32:56,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:32:56,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:32:56,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:32:56,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:32:56,658 INFO L87 Difference]: Start difference. First operand 1609 states and 3605 transitions. Second operand 6 states. [2019-12-07 11:32:57,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:32:57,072 INFO L93 Difference]: Finished difference Result 4481 states and 9905 transitions. [2019-12-07 11:32:57,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 11:32:57,072 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-07 11:32:57,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:32:57,092 INFO L225 Difference]: With dead ends: 4481 [2019-12-07 11:32:57,092 INFO L226 Difference]: Without dead ends: 4446 [2019-12-07 11:32:57,092 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 11:32:57,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4446 states. [2019-12-07 11:32:57,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4446 to 2169. [2019-12-07 11:32:57,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2169 states. [2019-12-07 11:32:57,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 2169 states and 4909 transitions. [2019-12-07 11:32:57,142 INFO L78 Accepts]: Start accepts. Automaton has 2169 states and 4909 transitions. Word has length 25 [2019-12-07 11:32:57,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:32:57,143 INFO L462 AbstractCegarLoop]: Abstraction has 2169 states and 4909 transitions. [2019-12-07 11:32:57,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:32:57,143 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 4909 transitions. [2019-12-07 11:32:57,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 11:32:57,145 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:32:57,145 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] [2019-12-07 11:32:57,145 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:32:57,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:32:57,145 INFO L82 PathProgramCache]: Analyzing trace with hash -662536504, now seen corresponding path program 1 times [2019-12-07 11:32:57,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:32:57,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951816589] [2019-12-07 11:32:57,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:32:57,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:32:57,210 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:32:57,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951816589] [2019-12-07 11:32:57,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:32:57,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:32:57,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834008819] [2019-12-07 11:32:57,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:32:57,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:32:57,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:32:57,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:32:57,212 INFO L87 Difference]: Start difference. First operand 2169 states and 4909 transitions. Second operand 5 states. [2019-12-07 11:32:57,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:32:57,477 INFO L93 Difference]: Finished difference Result 3139 states and 6955 transitions. [2019-12-07 11:32:57,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:32:57,478 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 11:32:57,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:32:57,490 INFO L225 Difference]: With dead ends: 3139 [2019-12-07 11:32:57,490 INFO L226 Difference]: Without dead ends: 3139 [2019-12-07 11:32:57,490 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:32:57,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3139 states. [2019-12-07 11:32:57,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3139 to 2639. [2019-12-07 11:32:57,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2639 states. [2019-12-07 11:32:57,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2639 states to 2639 states and 5924 transitions. [2019-12-07 11:32:57,526 INFO L78 Accepts]: Start accepts. Automaton has 2639 states and 5924 transitions. Word has length 26 [2019-12-07 11:32:57,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:32:57,526 INFO L462 AbstractCegarLoop]: Abstraction has 2639 states and 5924 transitions. [2019-12-07 11:32:57,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:32:57,526 INFO L276 IsEmpty]: Start isEmpty. Operand 2639 states and 5924 transitions. [2019-12-07 11:32:57,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 11:32:57,529 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:32:57,529 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] [2019-12-07 11:32:57,529 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:32:57,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:32:57,529 INFO L82 PathProgramCache]: Analyzing trace with hash 2133801578, now seen corresponding path program 1 times [2019-12-07 11:32:57,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:32:57,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574946525] [2019-12-07 11:32:57,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:32:57,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:32:57,603 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:32:57,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574946525] [2019-12-07 11:32:57,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:32:57,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:32:57,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841971828] [2019-12-07 11:32:57,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:32:57,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:32:57,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:32:57,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:32:57,604 INFO L87 Difference]: Start difference. First operand 2639 states and 5924 transitions. Second operand 6 states. [2019-12-07 11:32:57,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:32:57,961 INFO L93 Difference]: Finished difference Result 5512 states and 12000 transitions. [2019-12-07 11:32:57,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 11:32:57,961 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-07 11:32:57,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:32:57,967 INFO L225 Difference]: With dead ends: 5512 [2019-12-07 11:32:57,967 INFO L226 Difference]: Without dead ends: 5483 [2019-12-07 11:32:57,968 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 11:32:57,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5483 states. [2019-12-07 11:32:58,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5483 to 2614. [2019-12-07 11:32:58,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2614 states. [2019-12-07 11:32:58,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2614 states to 2614 states and 5890 transitions. [2019-12-07 11:32:58,019 INFO L78 Accepts]: Start accepts. Automaton has 2614 states and 5890 transitions. Word has length 26 [2019-12-07 11:32:58,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:32:58,019 INFO L462 AbstractCegarLoop]: Abstraction has 2614 states and 5890 transitions. [2019-12-07 11:32:58,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:32:58,019 INFO L276 IsEmpty]: Start isEmpty. Operand 2614 states and 5890 transitions. [2019-12-07 11:32:58,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 11:32:58,022 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:32:58,022 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:32:58,022 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:32:58,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:32:58,023 INFO L82 PathProgramCache]: Analyzing trace with hash -312964189, now seen corresponding path program 1 times [2019-12-07 11:32:58,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:32:58,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951908871] [2019-12-07 11:32:58,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:32:58,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:32:58,080 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:32:58,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951908871] [2019-12-07 11:32:58,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:32:58,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:32:58,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402296198] [2019-12-07 11:32:58,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:32:58,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:32:58,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:32:58,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:32:58,082 INFO L87 Difference]: Start difference. First operand 2614 states and 5890 transitions. Second operand 5 states. [2019-12-07 11:32:58,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:32:58,115 INFO L93 Difference]: Finished difference Result 1600 states and 3459 transitions. [2019-12-07 11:32:58,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:32:58,115 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 11:32:58,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:32:58,118 INFO L225 Difference]: With dead ends: 1600 [2019-12-07 11:32:58,118 INFO L226 Difference]: Without dead ends: 1454 [2019-12-07 11:32:58,118 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:32:58,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2019-12-07 11:32:58,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 1353. [2019-12-07 11:32:58,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1353 states. [2019-12-07 11:32:58,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 2958 transitions. [2019-12-07 11:32:58,144 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 2958 transitions. Word has length 27 [2019-12-07 11:32:58,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:32:58,145 INFO L462 AbstractCegarLoop]: Abstraction has 1353 states and 2958 transitions. [2019-12-07 11:32:58,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:32:58,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 2958 transitions. [2019-12-07 11:32:58,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 11:32:58,163 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:32:58,164 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] [2019-12-07 11:32:58,164 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:32:58,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:32:58,164 INFO L82 PathProgramCache]: Analyzing trace with hash 62245946, now seen corresponding path program 1 times [2019-12-07 11:32:58,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:32:58,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798192022] [2019-12-07 11:32:58,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:32:58,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:32:58,273 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:32:58,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798192022] [2019-12-07 11:32:58,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:32:58,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 11:32:58,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294058724] [2019-12-07 11:32:58,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 11:32:58,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:32:58,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 11:32:58,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:32:58,274 INFO L87 Difference]: Start difference. First operand 1353 states and 2958 transitions. Second operand 7 states. [2019-12-07 11:32:58,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:32:58,979 INFO L93 Difference]: Finished difference Result 2931 states and 6214 transitions. [2019-12-07 11:32:58,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 11:32:58,980 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-07 11:32:58,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:32:58,984 INFO L225 Difference]: With dead ends: 2931 [2019-12-07 11:32:58,984 INFO L226 Difference]: Without dead ends: 2931 [2019-12-07 11:32:58,985 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-12-07 11:32:58,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2931 states. [2019-12-07 11:32:59,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2931 to 1433. [2019-12-07 11:32:59,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1433 states. [2019-12-07 11:32:59,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 3150 transitions. [2019-12-07 11:32:59,019 INFO L78 Accepts]: Start accepts. Automaton has 1433 states and 3150 transitions. Word has length 51 [2019-12-07 11:32:59,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:32:59,019 INFO L462 AbstractCegarLoop]: Abstraction has 1433 states and 3150 transitions. [2019-12-07 11:32:59,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 11:32:59,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 3150 transitions. [2019-12-07 11:32:59,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 11:32:59,022 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:32:59,022 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] [2019-12-07 11:32:59,022 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:32:59,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:32:59,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1305614862, now seen corresponding path program 2 times [2019-12-07 11:32:59,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:32:59,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885457397] [2019-12-07 11:32:59,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:32:59,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:32:59,092 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:32:59,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885457397] [2019-12-07 11:32:59,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:32:59,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:32:59,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187250138] [2019-12-07 11:32:59,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:32:59,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:32:59,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:32:59,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:32:59,093 INFO L87 Difference]: Start difference. First operand 1433 states and 3150 transitions. Second operand 5 states. [2019-12-07 11:32:59,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:32:59,235 INFO L93 Difference]: Finished difference Result 1571 states and 3400 transitions. [2019-12-07 11:32:59,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:32:59,235 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-12-07 11:32:59,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:32:59,237 INFO L225 Difference]: With dead ends: 1571 [2019-12-07 11:32:59,237 INFO L226 Difference]: Without dead ends: 1571 [2019-12-07 11:32:59,238 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:32:59,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1571 states. [2019-12-07 11:32:59,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1571 to 1441. [2019-12-07 11:32:59,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1441 states. [2019-12-07 11:32:59,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1441 states to 1441 states and 3166 transitions. [2019-12-07 11:32:59,255 INFO L78 Accepts]: Start accepts. Automaton has 1441 states and 3166 transitions. Word has length 51 [2019-12-07 11:32:59,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:32:59,255 INFO L462 AbstractCegarLoop]: Abstraction has 1441 states and 3166 transitions. [2019-12-07 11:32:59,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:32:59,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1441 states and 3166 transitions. [2019-12-07 11:32:59,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 11:32:59,257 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:32:59,257 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] [2019-12-07 11:32:59,258 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:32:59,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:32:59,258 INFO L82 PathProgramCache]: Analyzing trace with hash 851846938, now seen corresponding path program 3 times [2019-12-07 11:32:59,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:32:59,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841416992] [2019-12-07 11:32:59,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:32:59,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:32:59,337 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:32:59,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841416992] [2019-12-07 11:32:59,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:32:59,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:32:59,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557514858] [2019-12-07 11:32:59,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:32:59,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:32:59,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:32:59,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:32:59,339 INFO L87 Difference]: Start difference. First operand 1441 states and 3166 transitions. Second operand 3 states. [2019-12-07 11:32:59,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:32:59,351 INFO L93 Difference]: Finished difference Result 1440 states and 3164 transitions. [2019-12-07 11:32:59,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:32:59,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-07 11:32:59,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:32:59,353 INFO L225 Difference]: With dead ends: 1440 [2019-12-07 11:32:59,353 INFO L226 Difference]: Without dead ends: 1440 [2019-12-07 11:32:59,353 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:32:59,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2019-12-07 11:32:59,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 1163. [2019-12-07 11:32:59,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1163 states. [2019-12-07 11:32:59,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 2589 transitions. [2019-12-07 11:32:59,370 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 2589 transitions. Word has length 51 [2019-12-07 11:32:59,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:32:59,370 INFO L462 AbstractCegarLoop]: Abstraction has 1163 states and 2589 transitions. [2019-12-07 11:32:59,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:32:59,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 2589 transitions. [2019-12-07 11:32:59,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 11:32:59,372 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:32:59,372 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] [2019-12-07 11:32:59,372 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:32:59,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:32:59,372 INFO L82 PathProgramCache]: Analyzing trace with hash -126849823, now seen corresponding path program 1 times [2019-12-07 11:32:59,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:32:59,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201953268] [2019-12-07 11:32:59,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:32:59,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:32:59,670 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:32:59,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201953268] [2019-12-07 11:32:59,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:32:59,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 11:32:59,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23830774] [2019-12-07 11:32:59,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 11:32:59,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:32:59,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 11:32:59,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-07 11:32:59,671 INFO L87 Difference]: Start difference. First operand 1163 states and 2589 transitions. Second operand 14 states. [2019-12-07 11:33:07,995 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 22 [2019-12-07 11:33:09,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:33:09,822 INFO L93 Difference]: Finished difference Result 7153 states and 15481 transitions. [2019-12-07 11:33:09,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-12-07 11:33:09,822 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 52 [2019-12-07 11:33:09,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:33:09,826 INFO L225 Difference]: With dead ends: 7153 [2019-12-07 11:33:09,826 INFO L226 Difference]: Without dead ends: 5382 [2019-12-07 11:33:09,828 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3294 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1548, Invalid=7194, Unknown=0, NotChecked=0, Total=8742 [2019-12-07 11:33:09,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5382 states. [2019-12-07 11:33:09,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5382 to 1220. [2019-12-07 11:33:09,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1220 states. [2019-12-07 11:33:09,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1220 states to 1220 states and 2756 transitions. [2019-12-07 11:33:09,856 INFO L78 Accepts]: Start accepts. Automaton has 1220 states and 2756 transitions. Word has length 52 [2019-12-07 11:33:09,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:33:09,856 INFO L462 AbstractCegarLoop]: Abstraction has 1220 states and 2756 transitions. [2019-12-07 11:33:09,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 11:33:09,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1220 states and 2756 transitions. [2019-12-07 11:33:09,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 11:33:09,857 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:33:09,858 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] [2019-12-07 11:33:09,858 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:33:09,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:33:09,858 INFO L82 PathProgramCache]: Analyzing trace with hash -673157137, now seen corresponding path program 2 times [2019-12-07 11:33:09,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:33:09,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004651671] [2019-12-07 11:33:09,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:33:09,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:33:10,005 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:33:10,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004651671] [2019-12-07 11:33:10,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:33:10,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 11:33:10,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188772975] [2019-12-07 11:33:10,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 11:33:10,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:33:10,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 11:33:10,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-07 11:33:10,007 INFO L87 Difference]: Start difference. First operand 1220 states and 2756 transitions. Second operand 12 states. [2019-12-07 11:33:14,472 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2019-12-07 11:33:15,409 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-12-07 11:33:15,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:33:15,739 INFO L93 Difference]: Finished difference Result 8387 states and 18539 transitions. [2019-12-07 11:33:15,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-12-07 11:33:15,739 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 52 [2019-12-07 11:33:15,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:33:15,745 INFO L225 Difference]: With dead ends: 8387 [2019-12-07 11:33:15,745 INFO L226 Difference]: Without dead ends: 7334 [2019-12-07 11:33:15,746 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2244 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1118, Invalid=4734, Unknown=0, NotChecked=0, Total=5852 [2019-12-07 11:33:15,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7334 states. [2019-12-07 11:33:15,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7334 to 1436. [2019-12-07 11:33:15,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1436 states. [2019-12-07 11:33:15,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1436 states and 3268 transitions. [2019-12-07 11:33:15,785 INFO L78 Accepts]: Start accepts. Automaton has 1436 states and 3268 transitions. Word has length 52 [2019-12-07 11:33:15,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:33:15,785 INFO L462 AbstractCegarLoop]: Abstraction has 1436 states and 3268 transitions. [2019-12-07 11:33:15,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 11:33:15,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1436 states and 3268 transitions. [2019-12-07 11:33:15,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 11:33:15,787 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:33:15,787 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] [2019-12-07 11:33:15,787 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:33:15,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:33:15,787 INFO L82 PathProgramCache]: Analyzing trace with hash 849576629, now seen corresponding path program 3 times [2019-12-07 11:33:15,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:33:15,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404531374] [2019-12-07 11:33:15,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:33:15,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:33:15,975 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:33:15,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404531374] [2019-12-07 11:33:15,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:33:15,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 11:33:15,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056657483] [2019-12-07 11:33:15,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 11:33:15,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:33:15,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 11:33:15,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-07 11:33:15,977 INFO L87 Difference]: Start difference. First operand 1436 states and 3268 transitions. Second operand 12 states. [2019-12-07 11:33:19,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:33:19,449 INFO L93 Difference]: Finished difference Result 5761 states and 12972 transitions. [2019-12-07 11:33:19,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-12-07 11:33:19,449 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 52 [2019-12-07 11:33:19,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:33:19,452 INFO L225 Difference]: With dead ends: 5761 [2019-12-07 11:33:19,452 INFO L226 Difference]: Without dead ends: 4957 [2019-12-07 11:33:19,454 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1730 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=972, Invalid=3998, Unknown=0, NotChecked=0, Total=4970 [2019-12-07 11:33:19,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4957 states. [2019-12-07 11:33:19,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4957 to 1574. [2019-12-07 11:33:19,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1574 states. [2019-12-07 11:33:19,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 3590 transitions. [2019-12-07 11:33:19,481 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 3590 transitions. Word has length 52 [2019-12-07 11:33:19,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:33:19,481 INFO L462 AbstractCegarLoop]: Abstraction has 1574 states and 3590 transitions. [2019-12-07 11:33:19,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 11:33:19,481 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 3590 transitions. [2019-12-07 11:33:19,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 11:33:19,483 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:33:19,483 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] [2019-12-07 11:33:19,483 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:33:19,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:33:19,483 INFO L82 PathProgramCache]: Analyzing trace with hash -829626562, now seen corresponding path program 1 times [2019-12-07 11:33:19,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:33:19,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355990409] [2019-12-07 11:33:19,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:33:19,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:33:19,505 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:33:19,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355990409] [2019-12-07 11:33:19,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:33:19,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:33:19,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798848299] [2019-12-07 11:33:19,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:33:19,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:33:19,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:33:19,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:33:19,506 INFO L87 Difference]: Start difference. First operand 1574 states and 3590 transitions. Second operand 3 states. [2019-12-07 11:33:19,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:33:19,531 INFO L93 Difference]: Finished difference Result 1999 states and 4478 transitions. [2019-12-07 11:33:19,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:33:19,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-07 11:33:19,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:33:19,533 INFO L225 Difference]: With dead ends: 1999 [2019-12-07 11:33:19,533 INFO L226 Difference]: Without dead ends: 1999 [2019-12-07 11:33:19,533 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:33:19,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1999 states. [2019-12-07 11:33:19,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1999 to 1356. [2019-12-07 11:33:19,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1356 states. [2019-12-07 11:33:19,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1356 states to 1356 states and 3068 transitions. [2019-12-07 11:33:19,547 INFO L78 Accepts]: Start accepts. Automaton has 1356 states and 3068 transitions. Word has length 52 [2019-12-07 11:33:19,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:33:19,547 INFO L462 AbstractCegarLoop]: Abstraction has 1356 states and 3068 transitions. [2019-12-07 11:33:19,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:33:19,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 3068 transitions. [2019-12-07 11:33:19,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 11:33:19,549 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:33:19,549 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] [2019-12-07 11:33:19,549 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:33:19,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:33:19,549 INFO L82 PathProgramCache]: Analyzing trace with hash 931488247, now seen corresponding path program 4 times [2019-12-07 11:33:19,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:33:19,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417722561] [2019-12-07 11:33:19,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:33:19,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:33:19,688 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:33:19,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417722561] [2019-12-07 11:33:19,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:33:19,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 11:33:19,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787096186] [2019-12-07 11:33:19,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 11:33:19,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:33:19,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 11:33:19,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-07 11:33:19,689 INFO L87 Difference]: Start difference. First operand 1356 states and 3068 transitions. Second operand 10 states. [2019-12-07 11:33:20,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:33:20,561 INFO L93 Difference]: Finished difference Result 3165 states and 6903 transitions. [2019-12-07 11:33:20,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 11:33:20,562 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2019-12-07 11:33:20,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:33:20,564 INFO L225 Difference]: With dead ends: 3165 [2019-12-07 11:33:20,564 INFO L226 Difference]: Without dead ends: 3165 [2019-12-07 11:33:20,564 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=417, Unknown=0, NotChecked=0, Total=552 [2019-12-07 11:33:20,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3165 states. [2019-12-07 11:33:20,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3165 to 1230. [2019-12-07 11:33:20,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1230 states. [2019-12-07 11:33:20,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 2767 transitions. [2019-12-07 11:33:20,582 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 2767 transitions. Word has length 52 [2019-12-07 11:33:20,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:33:20,583 INFO L462 AbstractCegarLoop]: Abstraction has 1230 states and 2767 transitions. [2019-12-07 11:33:20,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 11:33:20,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 2767 transitions. [2019-12-07 11:33:20,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 11:33:20,584 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:33:20,584 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:33:20,584 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:33:20,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:33:20,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1769358026, now seen corresponding path program 1 times [2019-12-07 11:33:20,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:33:20,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691764591] [2019-12-07 11:33:20,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:33:20,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:33:20,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:33:20,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691764591] [2019-12-07 11:33:20,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:33:20,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:33:20,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222047159] [2019-12-07 11:33:20,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:33:20,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:33:20,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:33:20,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:33:20,603 INFO L87 Difference]: Start difference. First operand 1230 states and 2767 transitions. Second operand 3 states. [2019-12-07 11:33:20,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:33:20,626 INFO L93 Difference]: Finished difference Result 1469 states and 3146 transitions. [2019-12-07 11:33:20,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:33:20,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-07 11:33:20,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:33:20,627 INFO L225 Difference]: With dead ends: 1469 [2019-12-07 11:33:20,627 INFO L226 Difference]: Without dead ends: 1469 [2019-12-07 11:33:20,628 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:33:20,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2019-12-07 11:33:20,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 1101. [2019-12-07 11:33:20,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1101 states. [2019-12-07 11:33:20,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 2400 transitions. [2019-12-07 11:33:20,644 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 2400 transitions. Word has length 52 [2019-12-07 11:33:20,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:33:20,644 INFO L462 AbstractCegarLoop]: Abstraction has 1101 states and 2400 transitions. [2019-12-07 11:33:20,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:33:20,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 2400 transitions. [2019-12-07 11:33:20,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 11:33:20,646 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:33:20,646 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] [2019-12-07 11:33:20,646 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:33:20,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:33:20,646 INFO L82 PathProgramCache]: Analyzing trace with hash -610861021, now seen corresponding path program 5 times [2019-12-07 11:33:20,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:33:20,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331061085] [2019-12-07 11:33:20,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:33:20,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:33:20,777 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:33:20,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331061085] [2019-12-07 11:33:20,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:33:20,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 11:33:20,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675069829] [2019-12-07 11:33:20,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 11:33:20,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:33:20,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 11:33:20,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-07 11:33:20,778 INFO L87 Difference]: Start difference. First operand 1101 states and 2400 transitions. Second operand 12 states. [2019-12-07 11:33:23,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:33:23,183 INFO L93 Difference]: Finished difference Result 4262 states and 8954 transitions. [2019-12-07 11:33:23,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-07 11:33:23,184 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 52 [2019-12-07 11:33:23,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:33:23,186 INFO L225 Difference]: With dead ends: 4262 [2019-12-07 11:33:23,186 INFO L226 Difference]: Without dead ends: 3970 [2019-12-07 11:33:23,187 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 667 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=400, Invalid=1762, Unknown=0, NotChecked=0, Total=2162 [2019-12-07 11:33:23,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3970 states. [2019-12-07 11:33:23,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3970 to 1095. [2019-12-07 11:33:23,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1095 states. [2019-12-07 11:33:23,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 2388 transitions. [2019-12-07 11:33:23,208 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 2388 transitions. Word has length 52 [2019-12-07 11:33:23,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:33:23,209 INFO L462 AbstractCegarLoop]: Abstraction has 1095 states and 2388 transitions. [2019-12-07 11:33:23,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 11:33:23,209 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 2388 transitions. [2019-12-07 11:33:23,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 11:33:23,210 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:33:23,210 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:33:23,210 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:33:23,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:33:23,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1769155969, now seen corresponding path program 6 times [2019-12-07 11:33:23,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:33:23,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310877989] [2019-12-07 11:33:23,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:33:23,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:33:23,257 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:33:23,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310877989] [2019-12-07 11:33:23,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:33:23,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:33:23,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664278443] [2019-12-07 11:33:23,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:33:23,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:33:23,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:33:23,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:33:23,258 INFO L87 Difference]: Start difference. First operand 1095 states and 2388 transitions. Second operand 4 states. [2019-12-07 11:33:23,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:33:23,270 INFO L93 Difference]: Finished difference Result 1769 states and 3819 transitions. [2019-12-07 11:33:23,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:33:23,270 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-12-07 11:33:23,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:33:23,271 INFO L225 Difference]: With dead ends: 1769 [2019-12-07 11:33:23,271 INFO L226 Difference]: Without dead ends: 764 [2019-12-07 11:33:23,271 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:33:23,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2019-12-07 11:33:23,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 764. [2019-12-07 11:33:23,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 764 states. [2019-12-07 11:33:23,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 764 states to 764 states and 1622 transitions. [2019-12-07 11:33:23,278 INFO L78 Accepts]: Start accepts. Automaton has 764 states and 1622 transitions. Word has length 52 [2019-12-07 11:33:23,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:33:23,278 INFO L462 AbstractCegarLoop]: Abstraction has 764 states and 1622 transitions. [2019-12-07 11:33:23,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:33:23,278 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1622 transitions. [2019-12-07 11:33:23,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 11:33:23,279 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:33:23,279 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] [2019-12-07 11:33:23,279 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:33:23,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:33:23,280 INFO L82 PathProgramCache]: Analyzing trace with hash 2075063759, now seen corresponding path program 7 times [2019-12-07 11:33:23,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:33:23,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298704770] [2019-12-07 11:33:23,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:33:23,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:33:23,324 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:33:23,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298704770] [2019-12-07 11:33:23,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:33:23,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 11:33:23,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399531162] [2019-12-07 11:33:23,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 11:33:23,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:33:23,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 11:33:23,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:33:23,325 INFO L87 Difference]: Start difference. First operand 764 states and 1622 transitions. Second operand 7 states. [2019-12-07 11:33:23,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:33:23,439 INFO L93 Difference]: Finished difference Result 1439 states and 2996 transitions. [2019-12-07 11:33:23,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 11:33:23,439 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-07 11:33:23,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:33:23,440 INFO L225 Difference]: With dead ends: 1439 [2019-12-07 11:33:23,440 INFO L226 Difference]: Without dead ends: 899 [2019-12-07 11:33:23,440 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-07 11:33:23,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2019-12-07 11:33:23,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 752. [2019-12-07 11:33:23,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 752 states. [2019-12-07 11:33:23,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 1570 transitions. [2019-12-07 11:33:23,447 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 1570 transitions. Word has length 52 [2019-12-07 11:33:23,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:33:23,447 INFO L462 AbstractCegarLoop]: Abstraction has 752 states and 1570 transitions. [2019-12-07 11:33:23,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 11:33:23,447 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 1570 transitions. [2019-12-07 11:33:23,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 11:33:23,448 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:33:23,448 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] [2019-12-07 11:33:23,448 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:33:23,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:33:23,448 INFO L82 PathProgramCache]: Analyzing trace with hash 2078058895, now seen corresponding path program 8 times [2019-12-07 11:33:23,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:33:23,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591996415] [2019-12-07 11:33:23,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:33:23,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:33:23,496 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:33:23,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591996415] [2019-12-07 11:33:23,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:33:23,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:33:23,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137245122] [2019-12-07 11:33:23,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:33:23,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:33:23,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:33:23,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:33:23,497 INFO L87 Difference]: Start difference. First operand 752 states and 1570 transitions. Second operand 4 states. [2019-12-07 11:33:23,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:33:23,537 INFO L93 Difference]: Finished difference Result 908 states and 1885 transitions. [2019-12-07 11:33:23,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:33:23,538 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-12-07 11:33:23,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:33:23,538 INFO L225 Difference]: With dead ends: 908 [2019-12-07 11:33:23,539 INFO L226 Difference]: Without dead ends: 908 [2019-12-07 11:33:23,539 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:33:23,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2019-12-07 11:33:23,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 719. [2019-12-07 11:33:23,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2019-12-07 11:33:23,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1499 transitions. [2019-12-07 11:33:23,548 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1499 transitions. Word has length 52 [2019-12-07 11:33:23,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:33:23,548 INFO L462 AbstractCegarLoop]: Abstraction has 719 states and 1499 transitions. [2019-12-07 11:33:23,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:33:23,549 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1499 transitions. [2019-12-07 11:33:23,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 11:33:23,550 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:33:23,550 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] [2019-12-07 11:33:23,550 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:33:23,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:33:23,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1710729972, now seen corresponding path program 1 times [2019-12-07 11:33:23,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:33:23,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075927565] [2019-12-07 11:33:23,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:33:23,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:33:23,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:33:23,620 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:33:23,620 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 11:33:23,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_54| 0 0))) (and (= 0 v_~x~0_148) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t595~0.base_29|)) (= 0 v_~y$flush_delayed~0_33) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$w_buff1~0_317 0) (= v_~y$r_buff1_thd0~0_179 0) (= 0 v_~__unbuffered_cnt~0_62) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t595~0.base_29| 4)) (= |v_ULTIMATE.start_main_~#t595~0.offset_20| 0) (= v_~y$mem_tmp~0_26 0) (= v_~y~0_149 0) (= 0 v_~y$r_buff1_thd2~0_326) (= v_~y$read_delayed~0_6 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t595~0.base_29|) (= v_~y$w_buff1_used~0_504 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t595~0.base_29| 1) |v_#valid_52|) (= v_~y$r_buff0_thd1~0_219 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t595~0.base_29| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t595~0.base_29|) |v_ULTIMATE.start_main_~#t595~0.offset_20| 0)) |v_#memory_int_15|) (= v_~y$r_buff1_thd1~0_159 0) (= 0 v_~weak$$choice0~0_21) (= 0 v_~y$read_delayed_var~0.base_7) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= 0 v_~__unbuffered_p1_EAX~0_47) (= 0 v_~y$r_buff0_thd2~0_362) (= v_~__unbuffered_p1_EBX~0_46 0) (= v_~y$w_buff0_used~0_796 0) (= v_~main$tmp_guard0~0_32 0) (= v_~y$r_buff0_thd0~0_136 0) (= v_~weak$$choice2~0_121 0) (= 0 v_~y$w_buff0~0_547) (= 0 |v_#NULL.base_5|) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t596~0.base=|v_ULTIMATE.start_main_~#t596~0.base_17|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_796, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_29|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_35|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_73|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_31|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_159, ~y$mem_tmp~0=v_~y$mem_tmp~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_547, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_219, ~y$flush_delayed~0=v_~y$flush_delayed~0_33, #length=|v_#length_15|, ~y~0=v_~y~0_149, ULTIMATE.start_main_~#t596~0.offset=|v_ULTIMATE.start_main_~#t596~0.offset_14|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_46, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, #NULL.base=|v_#NULL.base_5|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_326, ~weak$$choice0~0=v_~weak$$choice0~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_36|, ULTIMATE.start_main_~#t595~0.offset=|v_ULTIMATE.start_main_~#t595~0.offset_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_35|, ~y$w_buff1~0=v_~y$w_buff1~0_317, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_136, #valid=|v_#valid_52|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_362, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_7|, ULTIMATE.start_main_~#t595~0.base=|v_ULTIMATE.start_main_~#t595~0.base_29|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_18|, ~weak$$choice2~0=v_~weak$$choice2~0_121, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_179, ~x~0=v_~x~0_148, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_504} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ULTIMATE.start_main_~#t596~0.base, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t596~0.offset, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t595~0.offset, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t595~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 11:33:23,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L797-1-->L799: Formula: (and (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t596~0.base_12| 4)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t596~0.base_12| 1)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t596~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t596~0.base_12|) |v_ULTIMATE.start_main_~#t596~0.offset_10| 1))) (= |v_ULTIMATE.start_main_~#t596~0.offset_10| 0) (not (= 0 |v_ULTIMATE.start_main_~#t596~0.base_12|)) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t596~0.base_12|) 0) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t596~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t596~0.offset=|v_ULTIMATE.start_main_~#t596~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t596~0.base=|v_ULTIMATE.start_main_~#t596~0.base_12|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t596~0.offset, ULTIMATE.start_main_~#t596~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 11:33:23,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L4-->L738: Formula: (and (= v_~y$r_buff0_thd1~0_41 v_~y$r_buff1_thd1~0_23) (= v_~y$r_buff0_thd2~0_107 v_~y$r_buff1_thd2~0_62) (= v_~y$r_buff0_thd0~0_52 v_~y$r_buff1_thd0~0_32) (= v_~x~0_18 1) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_64 0)) (= v_~y$r_buff0_thd1~0_40 1)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_41, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_64} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_62, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_23, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_40, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_64, ~x~0=v_~x~0_18, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 11:33:23,625 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L739-->L739-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1616419108 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-1616419108 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-1616419108| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-1616419108 |P0Thread1of1ForFork0_#t~ite5_Out-1616419108|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1616419108, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1616419108} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1616419108|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1616419108, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1616419108} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 11:33:23,626 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L763-->L763-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-431906040 256) 0))) (or (and (= ~y$w_buff0~0_In-431906040 |P1Thread1of1ForFork1_#t~ite14_Out-431906040|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-431906040 256)))) (or (and (= (mod ~y$w_buff1_used~0_In-431906040 256) 0) .cse0) (= (mod ~y$w_buff0_used~0_In-431906040 256) 0) (and (= 0 (mod ~y$r_buff1_thd2~0_In-431906040 256)) .cse0))) .cse1 (= |P1Thread1of1ForFork1_#t~ite15_Out-431906040| |P1Thread1of1ForFork1_#t~ite14_Out-431906040|)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite14_In-431906040| |P1Thread1of1ForFork1_#t~ite14_Out-431906040|) (= |P1Thread1of1ForFork1_#t~ite15_Out-431906040| ~y$w_buff0~0_In-431906040)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-431906040, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-431906040, ~y$w_buff0~0=~y$w_buff0~0_In-431906040, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-431906040, ~weak$$choice2~0=~weak$$choice2~0_In-431906040, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In-431906040|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-431906040} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-431906040, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-431906040, ~y$w_buff0~0=~y$w_buff0~0_In-431906040, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-431906040, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out-431906040|, ~weak$$choice2~0=~weak$$choice2~0_In-431906040, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-431906040|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-431906040} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 11:33:23,626 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L764-->L764-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1011290037 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite17_Out1011290037| ~y$w_buff1~0_In1011290037) (= |P1Thread1of1ForFork1_#t~ite17_Out1011290037| |P1Thread1of1ForFork1_#t~ite18_Out1011290037|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1011290037 256)))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In1011290037 256) 0)) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1011290037 256))) (= 0 (mod ~y$w_buff0_used~0_In1011290037 256))))) (and (= |P1Thread1of1ForFork1_#t~ite18_Out1011290037| ~y$w_buff1~0_In1011290037) (= |P1Thread1of1ForFork1_#t~ite17_In1011290037| |P1Thread1of1ForFork1_#t~ite17_Out1011290037|) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1011290037, ~y$w_buff1~0=~y$w_buff1~0_In1011290037, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1011290037, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1011290037, ~weak$$choice2~0=~weak$$choice2~0_In1011290037, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In1011290037|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1011290037} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1011290037, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out1011290037|, ~y$w_buff1~0=~y$w_buff1~0_In1011290037, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1011290037, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1011290037, ~weak$$choice2~0=~weak$$choice2~0_In1011290037, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out1011290037|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1011290037} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-07 11:33:23,626 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L740-->L740-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In957162409 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In957162409 256))) (.cse3 (= (mod ~y$r_buff1_thd1~0_In957162409 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In957162409 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out957162409| 0)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out957162409| ~y$w_buff1_used~0_In957162409) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In957162409, ~y$w_buff0_used~0=~y$w_buff0_used~0_In957162409, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In957162409, ~y$w_buff1_used~0=~y$w_buff1_used~0_In957162409} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out957162409|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In957162409, ~y$w_buff0_used~0=~y$w_buff0_used~0_In957162409, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In957162409, ~y$w_buff1_used~0=~y$w_buff1_used~0_In957162409} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 11:33:23,627 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L741-->L742: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1774748054 256))) (.cse0 (= ~y$r_buff0_thd1~0_In-1774748054 ~y$r_buff0_thd1~0_Out-1774748054)) (.cse2 (= (mod ~y$r_buff0_thd1~0_In-1774748054 256) 0))) (or (and .cse0 .cse1) (and (= 0 ~y$r_buff0_thd1~0_Out-1774748054) (not .cse1) (not .cse2)) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1774748054, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1774748054} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1774748054, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1774748054|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1774748054} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 11:33:23,627 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L742-->L742-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In-667059654 256))) (.cse2 (= (mod ~y$r_buff0_thd1~0_In-667059654 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In-667059654 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-667059654 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-667059654| ~y$r_buff1_thd1~0_In-667059654) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P0Thread1of1ForFork0_#t~ite8_Out-667059654| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-667059654, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-667059654, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-667059654, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-667059654} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-667059654, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-667059654, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-667059654|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-667059654, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-667059654} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 11:33:23,627 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L765-->L765-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In50821591 256) 0))) (or (and (= ~y$w_buff0_used~0_In50821591 |P1Thread1of1ForFork1_#t~ite21_Out50821591|) (= |P1Thread1of1ForFork1_#t~ite20_In50821591| |P1Thread1of1ForFork1_#t~ite20_Out50821591|) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite20_Out50821591| ~y$w_buff0_used~0_In50821591) (= |P1Thread1of1ForFork1_#t~ite20_Out50821591| |P1Thread1of1ForFork1_#t~ite21_Out50821591|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In50821591 256)))) (or (and .cse1 (= (mod ~y$r_buff1_thd2~0_In50821591 256) 0)) (and .cse1 (= (mod ~y$w_buff1_used~0_In50821591 256) 0)) (= (mod ~y$w_buff0_used~0_In50821591 256) 0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In50821591, ~y$w_buff0_used~0=~y$w_buff0_used~0_In50821591, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In50821591|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In50821591, ~weak$$choice2~0=~weak$$choice2~0_In50821591, ~y$w_buff1_used~0=~y$w_buff1_used~0_In50821591} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In50821591, ~y$w_buff0_used~0=~y$w_buff0_used~0_In50821591, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out50821591|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In50821591, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out50821591|, ~weak$$choice2~0=~weak$$choice2~0_In50821591, ~y$w_buff1_used~0=~y$w_buff1_used~0_In50821591} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 11:33:23,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L767-->L768: Formula: (and (not (= (mod v_~weak$$choice2~0_28 256) 0)) (= v_~y$r_buff0_thd2~0_136 v_~y$r_buff0_thd2~0_135)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_136, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_135, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~weak$$choice2~0=v_~weak$$choice2~0_28, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_12|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 11:33:23,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L768-->L768-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-46855129 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite30_Out-46855129| ~y$r_buff1_thd2~0_In-46855129) (= |P1Thread1of1ForFork1_#t~ite29_In-46855129| |P1Thread1of1ForFork1_#t~ite29_Out-46855129|)) (and .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-46855129 256) 0))) (or (and (= 0 (mod ~y$w_buff1_used~0_In-46855129 256)) .cse1) (= (mod ~y$w_buff0_used~0_In-46855129 256) 0) (and (= (mod ~y$r_buff1_thd2~0_In-46855129 256) 0) .cse1))) (= |P1Thread1of1ForFork1_#t~ite29_Out-46855129| ~y$r_buff1_thd2~0_In-46855129) (= |P1Thread1of1ForFork1_#t~ite29_Out-46855129| |P1Thread1of1ForFork1_#t~ite30_Out-46855129|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-46855129, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-46855129|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-46855129, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-46855129, ~weak$$choice2~0=~weak$$choice2~0_In-46855129, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-46855129} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-46855129, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-46855129|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-46855129|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-46855129, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-46855129, ~weak$$choice2~0=~weak$$choice2~0_In-46855129, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-46855129} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 11:33:23,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~y$r_buff1_thd1~0_129 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_129, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 11:33:23,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L770-->L774: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= 0 v_~y$flush_delayed~0_6) (= v_~y~0_21 v_~y$mem_tmp~0_5)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~y~0=v_~y~0_21} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-07 11:33:23,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L774-2-->L774-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In1635833187 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1635833187 256)))) (or (and (or .cse0 .cse1) (= ~y~0_In1635833187 |P1Thread1of1ForFork1_#t~ite32_Out1635833187|)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite32_Out1635833187| ~y$w_buff1~0_In1635833187) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1635833187, ~y$w_buff1~0=~y$w_buff1~0_In1635833187, ~y~0=~y~0_In1635833187, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1635833187} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1635833187, ~y$w_buff1~0=~y$w_buff1~0_In1635833187, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1635833187|, ~y~0=~y~0_In1635833187, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1635833187} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 11:33:23,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L774-4-->L775: Formula: (= v_~y~0_29 |v_P1Thread1of1ForFork1_#t~ite32_6|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_6|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_5|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_5|, ~y~0=v_~y~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-07 11:33:23,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L775-->L775-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In666358140 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In666358140 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite34_Out666358140| 0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out666358140| ~y$w_buff0_used~0_In666358140) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In666358140, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In666358140} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In666358140, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In666358140, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out666358140|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 11:33:23,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In-706931676 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-706931676 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-706931676 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-706931676 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-706931676 |P1Thread1of1ForFork1_#t~ite35_Out-706931676|)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out-706931676| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-706931676, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-706931676, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-706931676, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-706931676} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-706931676, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-706931676, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-706931676, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-706931676|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-706931676} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 11:33:23,629 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L777-->L777-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-30281257 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-30281257 256) 0))) (or (and (= ~y$r_buff0_thd2~0_In-30281257 |P1Thread1of1ForFork1_#t~ite36_Out-30281257|) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite36_Out-30281257| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-30281257, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-30281257} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-30281257, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-30281257, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-30281257|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 11:33:23,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-458749234 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-458749234 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-458749234 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-458749234 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-458749234|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In-458749234 |P1Thread1of1ForFork1_#t~ite37_Out-458749234|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-458749234, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-458749234, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-458749234, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-458749234} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-458749234, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-458749234, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-458749234, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-458749234|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-458749234} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 11:33:23,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L778-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_270 |v_P1Thread1of1ForFork1_#t~ite37_40|) (= (+ v_~__unbuffered_cnt~0_47 1) v_~__unbuffered_cnt~0_46) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_40|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_270, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_39|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 11:33:23,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_300 256) 0) (= (mod v_~y$r_buff0_thd0~0_64 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 11:33:23,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-2067342227 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-2067342227 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out-2067342227| ~y$w_buff1~0_In-2067342227) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite40_Out-2067342227| ~y~0_In-2067342227) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-2067342227, ~y~0=~y~0_In-2067342227, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2067342227, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2067342227} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-2067342227|, ~y$w_buff1~0=~y$w_buff1~0_In-2067342227, ~y~0=~y~0_In-2067342227, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2067342227, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2067342227} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 11:33:23,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L805-4-->L806: Formula: (= v_~y~0_43 |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_10|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-07 11:33:23,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L806-->L806-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1732599518 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1732599518 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1732599518 |ULTIMATE.start_main_#t~ite42_Out-1732599518|)) (and (= 0 |ULTIMATE.start_main_#t~ite42_Out-1732599518|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1732599518, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1732599518} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1732599518, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1732599518, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1732599518|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 11:33:23,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L807-->L807-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1730206445 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1730206445 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-1730206445 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-1730206445 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite43_Out-1730206445| ~y$w_buff1_used~0_In-1730206445)) (and (= |ULTIMATE.start_main_#t~ite43_Out-1730206445| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1730206445, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1730206445, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1730206445, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1730206445} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1730206445, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1730206445, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1730206445|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1730206445, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1730206445} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 11:33:23,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L808-->L808-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-18617471 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-18617471 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-18617471| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd0~0_In-18617471 |ULTIMATE.start_main_#t~ite44_Out-18617471|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-18617471, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-18617471} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-18617471, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-18617471, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-18617471|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 11:33:23,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L809-->L809-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In258948570 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In258948570 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In258948570 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In258948570 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In258948570 |ULTIMATE.start_main_#t~ite45_Out258948570|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite45_Out258948570|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In258948570, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In258948570, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In258948570, ~y$w_buff1_used~0=~y$w_buff1_used~0_In258948570} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In258948570, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In258948570, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In258948570, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out258948570|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In258948570} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 11:33:23,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~y$r_buff1_thd0~0_140 |v_ULTIMATE.start_main_#t~ite45_40|) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= (ite (= (ite (not (and (= 2 v_~x~0_117) (= 2 v_~__unbuffered_p1_EAX~0_28) (= v_~__unbuffered_p1_EBX~0_24 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_17)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~x~0=v_~x~0_117, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_40|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x~0=v_~x~0_117, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_140, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 11:33:23,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:33:23 BasicIcfg [2019-12-07 11:33:23,669 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:33:23,669 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:33:23,669 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:33:23,669 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:33:23,670 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:32:51" (3/4) ... [2019-12-07 11:33:23,672 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 11:33:23,672 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_54| 0 0))) (and (= 0 v_~x~0_148) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t595~0.base_29|)) (= 0 v_~y$flush_delayed~0_33) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$w_buff1~0_317 0) (= v_~y$r_buff1_thd0~0_179 0) (= 0 v_~__unbuffered_cnt~0_62) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t595~0.base_29| 4)) (= |v_ULTIMATE.start_main_~#t595~0.offset_20| 0) (= v_~y$mem_tmp~0_26 0) (= v_~y~0_149 0) (= 0 v_~y$r_buff1_thd2~0_326) (= v_~y$read_delayed~0_6 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t595~0.base_29|) (= v_~y$w_buff1_used~0_504 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t595~0.base_29| 1) |v_#valid_52|) (= v_~y$r_buff0_thd1~0_219 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t595~0.base_29| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t595~0.base_29|) |v_ULTIMATE.start_main_~#t595~0.offset_20| 0)) |v_#memory_int_15|) (= v_~y$r_buff1_thd1~0_159 0) (= 0 v_~weak$$choice0~0_21) (= 0 v_~y$read_delayed_var~0.base_7) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= 0 v_~__unbuffered_p1_EAX~0_47) (= 0 v_~y$r_buff0_thd2~0_362) (= v_~__unbuffered_p1_EBX~0_46 0) (= v_~y$w_buff0_used~0_796 0) (= v_~main$tmp_guard0~0_32 0) (= v_~y$r_buff0_thd0~0_136 0) (= v_~weak$$choice2~0_121 0) (= 0 v_~y$w_buff0~0_547) (= 0 |v_#NULL.base_5|) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t596~0.base=|v_ULTIMATE.start_main_~#t596~0.base_17|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_796, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_29|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_35|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_73|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_31|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_159, ~y$mem_tmp~0=v_~y$mem_tmp~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_547, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_219, ~y$flush_delayed~0=v_~y$flush_delayed~0_33, #length=|v_#length_15|, ~y~0=v_~y~0_149, ULTIMATE.start_main_~#t596~0.offset=|v_ULTIMATE.start_main_~#t596~0.offset_14|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_46, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, #NULL.base=|v_#NULL.base_5|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_326, ~weak$$choice0~0=v_~weak$$choice0~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_36|, ULTIMATE.start_main_~#t595~0.offset=|v_ULTIMATE.start_main_~#t595~0.offset_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_35|, ~y$w_buff1~0=v_~y$w_buff1~0_317, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_136, #valid=|v_#valid_52|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_362, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_7|, ULTIMATE.start_main_~#t595~0.base=|v_ULTIMATE.start_main_~#t595~0.base_29|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_18|, ~weak$$choice2~0=v_~weak$$choice2~0_121, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_179, ~x~0=v_~x~0_148, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_504} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ULTIMATE.start_main_~#t596~0.base, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t596~0.offset, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t595~0.offset, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t595~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 11:33:23,672 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L797-1-->L799: Formula: (and (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t596~0.base_12| 4)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t596~0.base_12| 1)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t596~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t596~0.base_12|) |v_ULTIMATE.start_main_~#t596~0.offset_10| 1))) (= |v_ULTIMATE.start_main_~#t596~0.offset_10| 0) (not (= 0 |v_ULTIMATE.start_main_~#t596~0.base_12|)) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t596~0.base_12|) 0) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t596~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t596~0.offset=|v_ULTIMATE.start_main_~#t596~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t596~0.base=|v_ULTIMATE.start_main_~#t596~0.base_12|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t596~0.offset, ULTIMATE.start_main_~#t596~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 11:33:23,673 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L4-->L738: Formula: (and (= v_~y$r_buff0_thd1~0_41 v_~y$r_buff1_thd1~0_23) (= v_~y$r_buff0_thd2~0_107 v_~y$r_buff1_thd2~0_62) (= v_~y$r_buff0_thd0~0_52 v_~y$r_buff1_thd0~0_32) (= v_~x~0_18 1) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_64 0)) (= v_~y$r_buff0_thd1~0_40 1)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_41, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_64} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_62, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_23, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_40, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_64, ~x~0=v_~x~0_18, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 11:33:23,674 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L739-->L739-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1616419108 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-1616419108 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-1616419108| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-1616419108 |P0Thread1of1ForFork0_#t~ite5_Out-1616419108|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1616419108, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1616419108} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1616419108|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1616419108, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1616419108} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 11:33:23,674 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L763-->L763-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-431906040 256) 0))) (or (and (= ~y$w_buff0~0_In-431906040 |P1Thread1of1ForFork1_#t~ite14_Out-431906040|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-431906040 256)))) (or (and (= (mod ~y$w_buff1_used~0_In-431906040 256) 0) .cse0) (= (mod ~y$w_buff0_used~0_In-431906040 256) 0) (and (= 0 (mod ~y$r_buff1_thd2~0_In-431906040 256)) .cse0))) .cse1 (= |P1Thread1of1ForFork1_#t~ite15_Out-431906040| |P1Thread1of1ForFork1_#t~ite14_Out-431906040|)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite14_In-431906040| |P1Thread1of1ForFork1_#t~ite14_Out-431906040|) (= |P1Thread1of1ForFork1_#t~ite15_Out-431906040| ~y$w_buff0~0_In-431906040)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-431906040, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-431906040, ~y$w_buff0~0=~y$w_buff0~0_In-431906040, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-431906040, ~weak$$choice2~0=~weak$$choice2~0_In-431906040, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In-431906040|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-431906040} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-431906040, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-431906040, ~y$w_buff0~0=~y$w_buff0~0_In-431906040, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-431906040, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out-431906040|, ~weak$$choice2~0=~weak$$choice2~0_In-431906040, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-431906040|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-431906040} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 11:33:23,674 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L764-->L764-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1011290037 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite17_Out1011290037| ~y$w_buff1~0_In1011290037) (= |P1Thread1of1ForFork1_#t~ite17_Out1011290037| |P1Thread1of1ForFork1_#t~ite18_Out1011290037|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1011290037 256)))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In1011290037 256) 0)) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1011290037 256))) (= 0 (mod ~y$w_buff0_used~0_In1011290037 256))))) (and (= |P1Thread1of1ForFork1_#t~ite18_Out1011290037| ~y$w_buff1~0_In1011290037) (= |P1Thread1of1ForFork1_#t~ite17_In1011290037| |P1Thread1of1ForFork1_#t~ite17_Out1011290037|) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1011290037, ~y$w_buff1~0=~y$w_buff1~0_In1011290037, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1011290037, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1011290037, ~weak$$choice2~0=~weak$$choice2~0_In1011290037, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In1011290037|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1011290037} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1011290037, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out1011290037|, ~y$w_buff1~0=~y$w_buff1~0_In1011290037, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1011290037, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1011290037, ~weak$$choice2~0=~weak$$choice2~0_In1011290037, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out1011290037|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1011290037} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-07 11:33:23,675 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L740-->L740-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In957162409 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In957162409 256))) (.cse3 (= (mod ~y$r_buff1_thd1~0_In957162409 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In957162409 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out957162409| 0)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out957162409| ~y$w_buff1_used~0_In957162409) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In957162409, ~y$w_buff0_used~0=~y$w_buff0_used~0_In957162409, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In957162409, ~y$w_buff1_used~0=~y$w_buff1_used~0_In957162409} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out957162409|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In957162409, ~y$w_buff0_used~0=~y$w_buff0_used~0_In957162409, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In957162409, ~y$w_buff1_used~0=~y$w_buff1_used~0_In957162409} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 11:33:23,675 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L741-->L742: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1774748054 256))) (.cse0 (= ~y$r_buff0_thd1~0_In-1774748054 ~y$r_buff0_thd1~0_Out-1774748054)) (.cse2 (= (mod ~y$r_buff0_thd1~0_In-1774748054 256) 0))) (or (and .cse0 .cse1) (and (= 0 ~y$r_buff0_thd1~0_Out-1774748054) (not .cse1) (not .cse2)) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1774748054, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1774748054} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1774748054, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1774748054|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1774748054} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 11:33:23,675 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L742-->L742-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In-667059654 256))) (.cse2 (= (mod ~y$r_buff0_thd1~0_In-667059654 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In-667059654 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-667059654 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-667059654| ~y$r_buff1_thd1~0_In-667059654) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P0Thread1of1ForFork0_#t~ite8_Out-667059654| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-667059654, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-667059654, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-667059654, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-667059654} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-667059654, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-667059654, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-667059654|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-667059654, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-667059654} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 11:33:23,675 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L765-->L765-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In50821591 256) 0))) (or (and (= ~y$w_buff0_used~0_In50821591 |P1Thread1of1ForFork1_#t~ite21_Out50821591|) (= |P1Thread1of1ForFork1_#t~ite20_In50821591| |P1Thread1of1ForFork1_#t~ite20_Out50821591|) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite20_Out50821591| ~y$w_buff0_used~0_In50821591) (= |P1Thread1of1ForFork1_#t~ite20_Out50821591| |P1Thread1of1ForFork1_#t~ite21_Out50821591|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In50821591 256)))) (or (and .cse1 (= (mod ~y$r_buff1_thd2~0_In50821591 256) 0)) (and .cse1 (= (mod ~y$w_buff1_used~0_In50821591 256) 0)) (= (mod ~y$w_buff0_used~0_In50821591 256) 0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In50821591, ~y$w_buff0_used~0=~y$w_buff0_used~0_In50821591, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In50821591|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In50821591, ~weak$$choice2~0=~weak$$choice2~0_In50821591, ~y$w_buff1_used~0=~y$w_buff1_used~0_In50821591} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In50821591, ~y$w_buff0_used~0=~y$w_buff0_used~0_In50821591, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out50821591|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In50821591, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out50821591|, ~weak$$choice2~0=~weak$$choice2~0_In50821591, ~y$w_buff1_used~0=~y$w_buff1_used~0_In50821591} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 11:33:23,676 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L767-->L768: Formula: (and (not (= (mod v_~weak$$choice2~0_28 256) 0)) (= v_~y$r_buff0_thd2~0_136 v_~y$r_buff0_thd2~0_135)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_136, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_135, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~weak$$choice2~0=v_~weak$$choice2~0_28, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_12|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 11:33:23,676 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L768-->L768-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-46855129 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite30_Out-46855129| ~y$r_buff1_thd2~0_In-46855129) (= |P1Thread1of1ForFork1_#t~ite29_In-46855129| |P1Thread1of1ForFork1_#t~ite29_Out-46855129|)) (and .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-46855129 256) 0))) (or (and (= 0 (mod ~y$w_buff1_used~0_In-46855129 256)) .cse1) (= (mod ~y$w_buff0_used~0_In-46855129 256) 0) (and (= (mod ~y$r_buff1_thd2~0_In-46855129 256) 0) .cse1))) (= |P1Thread1of1ForFork1_#t~ite29_Out-46855129| ~y$r_buff1_thd2~0_In-46855129) (= |P1Thread1of1ForFork1_#t~ite29_Out-46855129| |P1Thread1of1ForFork1_#t~ite30_Out-46855129|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-46855129, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-46855129|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-46855129, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-46855129, ~weak$$choice2~0=~weak$$choice2~0_In-46855129, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-46855129} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-46855129, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-46855129|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-46855129|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-46855129, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-46855129, ~weak$$choice2~0=~weak$$choice2~0_In-46855129, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-46855129} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 11:33:23,676 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~y$r_buff1_thd1~0_129 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_129, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 11:33:23,676 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L770-->L774: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= 0 v_~y$flush_delayed~0_6) (= v_~y~0_21 v_~y$mem_tmp~0_5)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~y~0=v_~y~0_21} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-07 11:33:23,677 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L774-2-->L774-4: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In1635833187 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1635833187 256)))) (or (and (or .cse0 .cse1) (= ~y~0_In1635833187 |P1Thread1of1ForFork1_#t~ite32_Out1635833187|)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite32_Out1635833187| ~y$w_buff1~0_In1635833187) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1635833187, ~y$w_buff1~0=~y$w_buff1~0_In1635833187, ~y~0=~y~0_In1635833187, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1635833187} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1635833187, ~y$w_buff1~0=~y$w_buff1~0_In1635833187, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1635833187|, ~y~0=~y~0_In1635833187, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1635833187} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 11:33:23,677 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L774-4-->L775: Formula: (= v_~y~0_29 |v_P1Thread1of1ForFork1_#t~ite32_6|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_6|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_5|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_5|, ~y~0=v_~y~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-07 11:33:23,677 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L775-->L775-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In666358140 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In666358140 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite34_Out666358140| 0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out666358140| ~y$w_buff0_used~0_In666358140) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In666358140, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In666358140} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In666358140, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In666358140, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out666358140|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 11:33:23,677 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In-706931676 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-706931676 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-706931676 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-706931676 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-706931676 |P1Thread1of1ForFork1_#t~ite35_Out-706931676|)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out-706931676| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-706931676, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-706931676, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-706931676, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-706931676} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-706931676, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-706931676, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-706931676, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-706931676|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-706931676} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 11:33:23,677 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L777-->L777-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-30281257 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-30281257 256) 0))) (or (and (= ~y$r_buff0_thd2~0_In-30281257 |P1Thread1of1ForFork1_#t~ite36_Out-30281257|) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite36_Out-30281257| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-30281257, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-30281257} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-30281257, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-30281257, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-30281257|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 11:33:23,678 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-458749234 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-458749234 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-458749234 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-458749234 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-458749234|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In-458749234 |P1Thread1of1ForFork1_#t~ite37_Out-458749234|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-458749234, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-458749234, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-458749234, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-458749234} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-458749234, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-458749234, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-458749234, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-458749234|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-458749234} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 11:33:23,678 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L778-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_270 |v_P1Thread1of1ForFork1_#t~ite37_40|) (= (+ v_~__unbuffered_cnt~0_47 1) v_~__unbuffered_cnt~0_46) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_40|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_270, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_39|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 11:33:23,678 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_300 256) 0) (= (mod v_~y$r_buff0_thd0~0_64 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 11:33:23,678 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-2067342227 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-2067342227 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out-2067342227| ~y$w_buff1~0_In-2067342227) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite40_Out-2067342227| ~y~0_In-2067342227) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-2067342227, ~y~0=~y~0_In-2067342227, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2067342227, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2067342227} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-2067342227|, ~y$w_buff1~0=~y$w_buff1~0_In-2067342227, ~y~0=~y~0_In-2067342227, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2067342227, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2067342227} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 11:33:23,678 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L805-4-->L806: Formula: (= v_~y~0_43 |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_10|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-07 11:33:23,678 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L806-->L806-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1732599518 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1732599518 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1732599518 |ULTIMATE.start_main_#t~ite42_Out-1732599518|)) (and (= 0 |ULTIMATE.start_main_#t~ite42_Out-1732599518|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1732599518, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1732599518} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1732599518, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1732599518, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1732599518|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 11:33:23,678 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L807-->L807-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1730206445 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1730206445 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-1730206445 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-1730206445 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite43_Out-1730206445| ~y$w_buff1_used~0_In-1730206445)) (and (= |ULTIMATE.start_main_#t~ite43_Out-1730206445| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1730206445, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1730206445, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1730206445, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1730206445} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1730206445, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1730206445, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1730206445|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1730206445, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1730206445} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 11:33:23,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L808-->L808-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-18617471 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-18617471 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-18617471| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd0~0_In-18617471 |ULTIMATE.start_main_#t~ite44_Out-18617471|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-18617471, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-18617471} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-18617471, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-18617471, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-18617471|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 11:33:23,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L809-->L809-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In258948570 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In258948570 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In258948570 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In258948570 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In258948570 |ULTIMATE.start_main_#t~ite45_Out258948570|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite45_Out258948570|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In258948570, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In258948570, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In258948570, ~y$w_buff1_used~0=~y$w_buff1_used~0_In258948570} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In258948570, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In258948570, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In258948570, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out258948570|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In258948570} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 11:33:23,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~y$r_buff1_thd0~0_140 |v_ULTIMATE.start_main_#t~ite45_40|) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= (ite (= (ite (not (and (= 2 v_~x~0_117) (= 2 v_~__unbuffered_p1_EAX~0_28) (= v_~__unbuffered_p1_EBX~0_24 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_17)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~x~0=v_~x~0_117, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_40|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x~0=v_~x~0_117, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_140, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 11:33:23,726 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_49c604a2-b1a3-48f5-8b7d-c3f13e300bc5/bin/uautomizer/witness.graphml [2019-12-07 11:33:23,727 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:33:23,728 INFO L168 Benchmark]: Toolchain (without parser) took 32612.92 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 481.3 MB). Free memory was 939.3 MB in the beginning and 945.2 MB in the end (delta: -5.9 MB). Peak memory consumption was 475.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:33:23,728 INFO L168 Benchmark]: CDTParser took 0.22 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:33:23,728 INFO L168 Benchmark]: CACSL2BoogieTranslator took 383.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -149.9 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 11:33:23,728 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:33:23,728 INFO L168 Benchmark]: Boogie Preprocessor took 28.78 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:33:23,729 INFO L168 Benchmark]: RCFGBuilder took 380.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 11.5 GB. [2019-12-07 11:33:23,729 INFO L168 Benchmark]: TraceAbstraction took 31717.51 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 359.7 MB). Free memory was 1.0 GB in the beginning and 961.9 MB in the end (delta: 71.4 MB). Peak memory consumption was 431.1 MB. Max. memory is 11.5 GB. [2019-12-07 11:33:23,729 INFO L168 Benchmark]: Witness Printer took 57.40 ms. Allocated memory is still 1.5 GB. Free memory was 961.9 MB in the beginning and 945.2 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 11.5 GB. [2019-12-07 11:33:23,731 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.22 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 383.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -149.9 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.78 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 380.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 31717.51 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 359.7 MB). Free memory was 1.0 GB in the beginning and 961.9 MB in the end (delta: 71.4 MB). Peak memory consumption was 431.1 MB. Max. memory is 11.5 GB. * Witness Printer took 57.40 ms. Allocated memory is still 1.5 GB. Free memory was 961.9 MB in the beginning and 945.2 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.0s, 147 ProgramPointsBefore, 77 ProgramPointsAfterwards, 181 TransitionsBefore, 87 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 27 ChoiceCompositions, 4555 VarBasedMoverChecksPositive, 216 VarBasedMoverChecksNegative, 60 SemBasedMoverChecksPositive, 196 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.9s, 0 MoverChecksTotal, 47763 CheckedPairsTotal, 101 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(&t595, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L799] FCALL, FORK 0 pthread_create(&t596, ((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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) 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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 x = 2 [L755] 2 __unbuffered_p1_EAX = x [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 y$flush_delayed = weak$$choice2 [L761] 2 y$mem_tmp = y 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=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __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=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L762] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L763] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L764] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) 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=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L766] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L768] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L776] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L777] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [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=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L807] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L808] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 31.5s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 25.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3269 SDtfs, 7950 SDslu, 10364 SDs, 0 SdLazy, 12351 SolverSat, 1182 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 433 GetRequests, 44 SyntacticMatches, 15 SemanticMatches, 374 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8132 ImplicationChecksByTransitivity, 10.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8640occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 20 MinimizatonAttempts, 27316 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 858 NumberOfCodeBlocks, 858 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 785 ConstructedInterpolants, 0 QuantifiedInterpolants, 254335 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...