./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix034_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix034_pso.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 ff5c85ebee88b83fb277698b63b87ea24f313b6a ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-11-28 18:12:24,520 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:12:24,522 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:12:24,535 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:12:24,536 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:12:24,537 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:12:24,539 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:12:24,541 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:12:24,542 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:12:24,543 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:12:24,544 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:12:24,546 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:12:24,546 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:12:24,547 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:12:24,548 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:12:24,549 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:12:24,550 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:12:24,551 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:12:24,553 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:12:24,555 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:12:24,557 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:12:24,558 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:12:24,560 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:12:24,561 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:12:24,563 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:12:24,564 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:12:24,564 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:12:24,565 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:12:24,565 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:12:24,566 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:12:24,567 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:12:24,568 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:12:24,568 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:12:24,569 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:12:24,570 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:12:24,571 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:12:24,571 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:12:24,572 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:12:24,572 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:12:24,573 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:12:24,574 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:12:24,575 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 18:12:24,605 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:12:24,606 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:12:24,608 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:12:24,608 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:12:24,608 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:12:24,608 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:12:24,609 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:12:24,609 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:12:24,609 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:12:24,609 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:12:24,610 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:12:24,610 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:12:24,611 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:12:24,611 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:12:24,612 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:12:24,612 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:12:24,612 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:12:24,612 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:12:24,612 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:12:24,613 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:12:24,613 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:12:24,613 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:12:24,614 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:12:24,614 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:12:24,614 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:12:24,614 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:12:24,614 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:12:24,615 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:12:24,615 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:12:24,615 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> ff5c85ebee88b83fb277698b63b87ea24f313b6a [2019-11-28 18:12:24,926 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:12:24,941 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:12:24,945 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:12:24,946 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:12:24,947 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:12:24,948 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix034_pso.opt.i [2019-11-28 18:12:25,013 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c817481df/69944b8092a14a57bb7e8df016506093/FLAGb81fe1e97 [2019-11-28 18:12:25,569 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:12:25,570 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix034_pso.opt.i [2019-11-28 18:12:25,591 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c817481df/69944b8092a14a57bb7e8df016506093/FLAGb81fe1e97 [2019-11-28 18:12:25,813 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c817481df/69944b8092a14a57bb7e8df016506093 [2019-11-28 18:12:25,816 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:12:25,818 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:12:25,822 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:12:25,822 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:12:25,826 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:12:25,827 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:12:25" (1/1) ... [2019-11-28 18:12:25,830 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5725aa2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:25, skipping insertion in model container [2019-11-28 18:12:25,831 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:12:25" (1/1) ... [2019-11-28 18:12:25,839 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:12:25,912 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:12:26,504 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:12:26,518 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:12:26,581 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:12:26,661 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:12:26,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:26 WrapperNode [2019-11-28 18:12:26,663 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:12:26,664 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:12:26,664 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:12:26,664 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:12:26,673 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:26" (1/1) ... [2019-11-28 18:12:26,693 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:26" (1/1) ... [2019-11-28 18:12:26,725 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:12:26,725 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:12:26,725 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:12:26,726 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:12:26,735 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:26" (1/1) ... [2019-11-28 18:12:26,735 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:26" (1/1) ... [2019-11-28 18:12:26,739 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:26" (1/1) ... [2019-11-28 18:12:26,740 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:26" (1/1) ... [2019-11-28 18:12:26,750 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:26" (1/1) ... [2019-11-28 18:12:26,754 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:26" (1/1) ... [2019-11-28 18:12:26,757 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:26" (1/1) ... [2019-11-28 18:12:26,762 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:12:26,762 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:12:26,762 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:12:26,762 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:12:26,763 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 18:12:26,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:12:26,820 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:12:26,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:12:26,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:12:26,821 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:12:26,821 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:12:26,821 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:12:26,821 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:12:26,821 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:12:26,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:12:26,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:12:26,823 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-28 18:12:27,469 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:12:27,469 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:12:27,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:12:27 BoogieIcfgContainer [2019-11-28 18:12:27,471 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:12:27,472 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:12:27,473 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:12:27,476 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:12:27,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:12:25" (1/3) ... [2019-11-28 18:12:27,478 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39e12c85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:12:27, skipping insertion in model container [2019-11-28 18:12:27,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:12:26" (2/3) ... [2019-11-28 18:12:27,480 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39e12c85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:12:27, skipping insertion in model container [2019-11-28 18:12:27,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:12:27" (3/3) ... [2019-11-28 18:12:27,483 INFO L109 eAbstractionObserver]: Analyzing ICFG mix034_pso.opt.i [2019-11-28 18:12:27,496 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:12:27,497 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:12:27,511 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:12:27,512 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:12:27,566 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,568 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,569 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,577 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,578 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,579 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,580 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,587 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,588 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,588 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,588 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,588 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,590 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,591 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,591 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,591 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,591 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,591 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,592 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,595 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,595 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,596 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,597 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,598 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,599 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,600 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,601 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,606 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,609 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,610 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,611 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,611 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,611 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,612 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,613 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,624 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:12:27,644 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-28 18:12:27,662 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:12:27,662 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:12:27,662 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:12:27,662 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:12:27,662 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:12:27,662 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:12:27,663 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:12:27,663 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:12:27,677 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 165 transitions [2019-11-28 18:12:27,679 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 137 places, 165 transitions [2019-11-28 18:12:27,773 INFO L134 PetriNetUnfolder]: 35/163 cut-off events. [2019-11-28 18:12:27,774 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:12:27,794 INFO L76 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 163 events. 35/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 558 event pairs. 6/132 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-11-28 18:12:27,814 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 137 places, 165 transitions [2019-11-28 18:12:27,856 INFO L134 PetriNetUnfolder]: 35/163 cut-off events. [2019-11-28 18:12:27,856 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:12:27,862 INFO L76 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 163 events. 35/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 558 event pairs. 6/132 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-11-28 18:12:27,877 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-11-28 18:12:27,878 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:12:32,572 WARN L192 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-11-28 18:12:32,698 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-11-28 18:12:32,860 INFO L206 etLargeBlockEncoding]: Checked pairs total: 45287 [2019-11-28 18:12:32,861 INFO L214 etLargeBlockEncoding]: Total number of compositions: 103 [2019-11-28 18:12:32,865 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 67 places, 80 transitions [2019-11-28 18:12:33,312 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6574 states. [2019-11-28 18:12:33,315 INFO L276 IsEmpty]: Start isEmpty. Operand 6574 states. [2019-11-28 18:12:33,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-28 18:12:33,328 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:33,329 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-28 18:12:33,330 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:33,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:33,341 INFO L82 PathProgramCache]: Analyzing trace with hash 679710407, now seen corresponding path program 1 times [2019-11-28 18:12:33,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:33,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490825139] [2019-11-28 18:12:33,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:33,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:33,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:33,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490825139] [2019-11-28 18:12:33,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:33,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:12:33,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672459394] [2019-11-28 18:12:33,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:33,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:33,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:33,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:33,764 INFO L87 Difference]: Start difference. First operand 6574 states. Second operand 3 states. [2019-11-28 18:12:34,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:34,077 INFO L93 Difference]: Finished difference Result 6414 states and 21820 transitions. [2019-11-28 18:12:34,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:34,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-11-28 18:12:34,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:34,153 INFO L225 Difference]: With dead ends: 6414 [2019-11-28 18:12:34,153 INFO L226 Difference]: Without dead ends: 6042 [2019-11-28 18:12:34,155 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-11-28 18:12:34,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6042 states. [2019-11-28 18:12:34,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6042 to 6042. [2019-11-28 18:12:34,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6042 states. [2019-11-28 18:12:34,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6042 states to 6042 states and 20517 transitions. [2019-11-28 18:12:34,540 INFO L78 Accepts]: Start accepts. Automaton has 6042 states and 20517 transitions. Word has length 5 [2019-11-28 18:12:34,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:34,540 INFO L462 AbstractCegarLoop]: Abstraction has 6042 states and 20517 transitions. [2019-11-28 18:12:34,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:34,540 INFO L276 IsEmpty]: Start isEmpty. Operand 6042 states and 20517 transitions. [2019-11-28 18:12:34,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 18:12:34,546 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:34,546 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:34,546 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:34,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:34,547 INFO L82 PathProgramCache]: Analyzing trace with hash 200851233, now seen corresponding path program 1 times [2019-11-28 18:12:34,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:34,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412666992] [2019-11-28 18:12:34,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:34,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:34,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:34,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412666992] [2019-11-28 18:12:34,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:34,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:12:34,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333946505] [2019-11-28 18:12:34,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:12:34,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:34,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:12:34,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:12:34,741 INFO L87 Difference]: Start difference. First operand 6042 states and 20517 transitions. Second operand 4 states. [2019-11-28 18:12:35,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:35,090 INFO L93 Difference]: Finished difference Result 9128 states and 29677 transitions. [2019-11-28 18:12:35,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:12:35,090 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 18:12:35,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:35,165 INFO L225 Difference]: With dead ends: 9128 [2019-11-28 18:12:35,165 INFO L226 Difference]: Without dead ends: 9113 [2019-11-28 18:12:35,166 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:12:35,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9113 states. [2019-11-28 18:12:35,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9113 to 8280. [2019-11-28 18:12:35,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8280 states. [2019-11-28 18:12:35,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8280 states to 8280 states and 27392 transitions. [2019-11-28 18:12:35,550 INFO L78 Accepts]: Start accepts. Automaton has 8280 states and 27392 transitions. Word has length 11 [2019-11-28 18:12:35,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:35,550 INFO L462 AbstractCegarLoop]: Abstraction has 8280 states and 27392 transitions. [2019-11-28 18:12:35,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:12:35,551 INFO L276 IsEmpty]: Start isEmpty. Operand 8280 states and 27392 transitions. [2019-11-28 18:12:35,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:12:35,556 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:35,556 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:35,556 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:35,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:35,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1157318615, now seen corresponding path program 1 times [2019-11-28 18:12:35,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:35,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398175118] [2019-11-28 18:12:35,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:35,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:35,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:35,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398175118] [2019-11-28 18:12:35,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:35,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:12:35,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329387941] [2019-11-28 18:12:35,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:35,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:35,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:35,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:35,623 INFO L87 Difference]: Start difference. First operand 8280 states and 27392 transitions. Second operand 3 states. [2019-11-28 18:12:35,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:35,771 INFO L93 Difference]: Finished difference Result 10675 states and 35421 transitions. [2019-11-28 18:12:35,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:35,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-28 18:12:35,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:35,823 INFO L225 Difference]: With dead ends: 10675 [2019-11-28 18:12:35,823 INFO L226 Difference]: Without dead ends: 10675 [2019-11-28 18:12:35,824 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-11-28 18:12:36,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10675 states. [2019-11-28 18:12:36,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10675 to 9779. [2019-11-28 18:12:36,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9779 states. [2019-11-28 18:12:36,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9779 states to 9779 states and 32749 transitions. [2019-11-28 18:12:36,344 INFO L78 Accepts]: Start accepts. Automaton has 9779 states and 32749 transitions. Word has length 14 [2019-11-28 18:12:36,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:36,345 INFO L462 AbstractCegarLoop]: Abstraction has 9779 states and 32749 transitions. [2019-11-28 18:12:36,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:36,345 INFO L276 IsEmpty]: Start isEmpty. Operand 9779 states and 32749 transitions. [2019-11-28 18:12:36,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:12:36,348 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:36,348 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:36,349 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:36,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:36,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1294893453, now seen corresponding path program 1 times [2019-11-28 18:12:36,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:36,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171615743] [2019-11-28 18:12:36,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:36,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:36,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:36,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171615743] [2019-11-28 18:12:36,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:36,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:12:36,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970574459] [2019-11-28 18:12:36,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:12:36,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:36,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:12:36,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:12:36,476 INFO L87 Difference]: Start difference. First operand 9779 states and 32749 transitions. Second operand 4 states. [2019-11-28 18:12:36,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:36,741 INFO L93 Difference]: Finished difference Result 11875 states and 38719 transitions. [2019-11-28 18:12:36,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:12:36,742 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:12:36,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:36,793 INFO L225 Difference]: With dead ends: 11875 [2019-11-28 18:12:36,794 INFO L226 Difference]: Without dead ends: 11864 [2019-11-28 18:12:36,794 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-11-28 18:12:36,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11864 states. [2019-11-28 18:12:37,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11864 to 10704. [2019-11-28 18:12:37,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10704 states. [2019-11-28 18:12:37,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10704 states to 10704 states and 35442 transitions. [2019-11-28 18:12:37,161 INFO L78 Accepts]: Start accepts. Automaton has 10704 states and 35442 transitions. Word has length 14 [2019-11-28 18:12:37,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:37,161 INFO L462 AbstractCegarLoop]: Abstraction has 10704 states and 35442 transitions. [2019-11-28 18:12:37,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:12:37,162 INFO L276 IsEmpty]: Start isEmpty. Operand 10704 states and 35442 transitions. [2019-11-28 18:12:37,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:12:37,166 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:37,166 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:37,166 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:37,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:37,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1889466766, now seen corresponding path program 1 times [2019-11-28 18:12:37,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:37,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776484891] [2019-11-28 18:12:37,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:37,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:37,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:37,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776484891] [2019-11-28 18:12:37,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:37,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:12:37,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873339750] [2019-11-28 18:12:37,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:12:37,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:37,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:12:37,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:12:37,230 INFO L87 Difference]: Start difference. First operand 10704 states and 35442 transitions. Second operand 4 states. [2019-11-28 18:12:37,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:37,458 INFO L93 Difference]: Finished difference Result 13204 states and 43019 transitions. [2019-11-28 18:12:37,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:12:37,459 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:12:37,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:37,502 INFO L225 Difference]: With dead ends: 13204 [2019-11-28 18:12:37,503 INFO L226 Difference]: Without dead ends: 13189 [2019-11-28 18:12:37,503 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-11-28 18:12:37,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13189 states. [2019-11-28 18:12:37,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13189 to 10970. [2019-11-28 18:12:37,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10970 states. [2019-11-28 18:12:37,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10970 states to 10970 states and 36426 transitions. [2019-11-28 18:12:37,987 INFO L78 Accepts]: Start accepts. Automaton has 10970 states and 36426 transitions. Word has length 14 [2019-11-28 18:12:37,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:37,988 INFO L462 AbstractCegarLoop]: Abstraction has 10970 states and 36426 transitions. [2019-11-28 18:12:37,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:12:37,988 INFO L276 IsEmpty]: Start isEmpty. Operand 10970 states and 36426 transitions. [2019-11-28 18:12:37,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:12:37,992 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:37,992 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:37,992 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:37,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:37,993 INFO L82 PathProgramCache]: Analyzing trace with hash 531752594, now seen corresponding path program 1 times [2019-11-28 18:12:37,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:37,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63239062] [2019-11-28 18:12:37,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:38,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:38,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:38,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63239062] [2019-11-28 18:12:38,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:38,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:12:38,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314581737] [2019-11-28 18:12:38,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:38,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:38,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:38,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:38,054 INFO L87 Difference]: Start difference. First operand 10970 states and 36426 transitions. Second operand 3 states. [2019-11-28 18:12:38,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:38,115 INFO L93 Difference]: Finished difference Result 10394 states and 33999 transitions. [2019-11-28 18:12:38,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:38,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 18:12:38,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:38,160 INFO L225 Difference]: With dead ends: 10394 [2019-11-28 18:12:38,160 INFO L226 Difference]: Without dead ends: 10394 [2019-11-28 18:12:38,161 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-11-28 18:12:38,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10394 states. [2019-11-28 18:12:38,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10394 to 10274. [2019-11-28 18:12:38,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10274 states. [2019-11-28 18:12:38,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10274 states to 10274 states and 33651 transitions. [2019-11-28 18:12:38,465 INFO L78 Accepts]: Start accepts. Automaton has 10274 states and 33651 transitions. Word has length 16 [2019-11-28 18:12:38,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:38,466 INFO L462 AbstractCegarLoop]: Abstraction has 10274 states and 33651 transitions. [2019-11-28 18:12:38,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:38,466 INFO L276 IsEmpty]: Start isEmpty. Operand 10274 states and 33651 transitions. [2019-11-28 18:12:38,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:12:38,471 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:38,472 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:38,472 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:38,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:38,473 INFO L82 PathProgramCache]: Analyzing trace with hash -797570926, now seen corresponding path program 1 times [2019-11-28 18:12:38,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:38,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227286834] [2019-11-28 18:12:38,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:38,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:38,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:38,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227286834] [2019-11-28 18:12:38,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:38,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:12:38,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086385802] [2019-11-28 18:12:38,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:38,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:38,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:38,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:38,583 INFO L87 Difference]: Start difference. First operand 10274 states and 33651 transitions. Second operand 3 states. [2019-11-28 18:12:38,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:38,654 INFO L93 Difference]: Finished difference Result 10159 states and 33246 transitions. [2019-11-28 18:12:38,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:38,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 18:12:38,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:38,698 INFO L225 Difference]: With dead ends: 10159 [2019-11-28 18:12:38,698 INFO L226 Difference]: Without dead ends: 10159 [2019-11-28 18:12:38,699 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-11-28 18:12:38,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10159 states. [2019-11-28 18:12:38,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10159 to 10151. [2019-11-28 18:12:38,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10151 states. [2019-11-28 18:12:39,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10151 states to 10151 states and 33234 transitions. [2019-11-28 18:12:39,001 INFO L78 Accepts]: Start accepts. Automaton has 10151 states and 33234 transitions. Word has length 16 [2019-11-28 18:12:39,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:39,001 INFO L462 AbstractCegarLoop]: Abstraction has 10151 states and 33234 transitions. [2019-11-28 18:12:39,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:39,001 INFO L276 IsEmpty]: Start isEmpty. Operand 10151 states and 33234 transitions. [2019-11-28 18:12:39,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 18:12:39,006 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:39,007 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:39,007 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:39,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:39,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1464047721, now seen corresponding path program 1 times [2019-11-28 18:12:39,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:39,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908399869] [2019-11-28 18:12:39,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:39,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:39,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:39,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908399869] [2019-11-28 18:12:39,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:39,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:12:39,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406343416] [2019-11-28 18:12:39,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:39,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:39,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:39,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:39,079 INFO L87 Difference]: Start difference. First operand 10151 states and 33234 transitions. Second operand 3 states. [2019-11-28 18:12:39,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:39,093 INFO L93 Difference]: Finished difference Result 1555 states and 3808 transitions. [2019-11-28 18:12:39,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:39,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-28 18:12:39,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:39,098 INFO L225 Difference]: With dead ends: 1555 [2019-11-28 18:12:39,098 INFO L226 Difference]: Without dead ends: 1555 [2019-11-28 18:12:39,099 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11-28 18:12:39,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1555 states. [2019-11-28 18:12:39,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1555 to 1555. [2019-11-28 18:12:39,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2019-11-28 18:12:39,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 3808 transitions. [2019-11-28 18:12:39,126 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 3808 transitions. Word has length 18 [2019-11-28 18:12:39,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:39,127 INFO L462 AbstractCegarLoop]: Abstraction has 1555 states and 3808 transitions. [2019-11-28 18:12:39,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:39,127 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 3808 transitions. [2019-11-28 18:12:39,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 18:12:39,131 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:39,132 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-11-28 18:12:39,132 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:39,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:39,132 INFO L82 PathProgramCache]: Analyzing trace with hash -2116463787, now seen corresponding path program 1 times [2019-11-28 18:12:39,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:39,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499806310] [2019-11-28 18:12:39,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:39,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:39,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:39,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499806310] [2019-11-28 18:12:39,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:39,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:12:39,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76583571] [2019-11-28 18:12:39,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:12:39,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:39,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:12:39,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:12:39,199 INFO L87 Difference]: Start difference. First operand 1555 states and 3808 transitions. Second operand 3 states. [2019-11-28 18:12:39,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:39,252 INFO L93 Difference]: Finished difference Result 1997 states and 4552 transitions. [2019-11-28 18:12:39,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:12:39,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-28 18:12:39,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:39,258 INFO L225 Difference]: With dead ends: 1997 [2019-11-28 18:12:39,259 INFO L226 Difference]: Without dead ends: 1997 [2019-11-28 18:12:39,259 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-11-28 18:12:39,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1997 states. [2019-11-28 18:12:39,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1997 to 1445. [2019-11-28 18:12:39,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-11-28 18:12:39,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 3266 transitions. [2019-11-28 18:12:39,286 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 3266 transitions. Word has length 26 [2019-11-28 18:12:39,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:39,286 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 3266 transitions. [2019-11-28 18:12:39,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:12:39,287 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 3266 transitions. [2019-11-28 18:12:39,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 18:12:39,289 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:39,290 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-11-28 18:12:39,290 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:39,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:39,290 INFO L82 PathProgramCache]: Analyzing trace with hash 474142059, now seen corresponding path program 1 times [2019-11-28 18:12:39,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:39,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150434478] [2019-11-28 18:12:39,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:39,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:39,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:39,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150434478] [2019-11-28 18:12:39,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:39,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:12:39,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654925655] [2019-11-28 18:12:39,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:12:39,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:39,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:12:39,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:12:39,349 INFO L87 Difference]: Start difference. First operand 1445 states and 3266 transitions. Second operand 4 states. [2019-11-28 18:12:39,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:39,370 INFO L93 Difference]: Finished difference Result 639 states and 1359 transitions. [2019-11-28 18:12:39,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:12:39,370 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-11-28 18:12:39,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:39,372 INFO L225 Difference]: With dead ends: 639 [2019-11-28 18:12:39,372 INFO L226 Difference]: Without dead ends: 639 [2019-11-28 18:12:39,373 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-11-28 18:12:39,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2019-11-28 18:12:39,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 639. [2019-11-28 18:12:39,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-11-28 18:12:39,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 1359 transitions. [2019-11-28 18:12:39,383 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 1359 transitions. Word has length 26 [2019-11-28 18:12:39,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:39,385 INFO L462 AbstractCegarLoop]: Abstraction has 639 states and 1359 transitions. [2019-11-28 18:12:39,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:12:39,385 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 1359 transitions. [2019-11-28 18:12:39,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 18:12:39,389 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:39,390 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] [2019-11-28 18:12:39,390 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:39,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:39,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1697663251, now seen corresponding path program 1 times [2019-11-28 18:12:39,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:39,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786613603] [2019-11-28 18:12:39,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:39,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:39,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:39,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786613603] [2019-11-28 18:12:39,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:39,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 18:12:39,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176582342] [2019-11-28 18:12:39,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 18:12:39,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:39,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 18:12:39,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-28 18:12:39,724 INFO L87 Difference]: Start difference. First operand 639 states and 1359 transitions. Second operand 9 states. [2019-11-28 18:12:40,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:40,203 INFO L93 Difference]: Finished difference Result 1304 states and 2795 transitions. [2019-11-28 18:12:40,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 18:12:40,204 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2019-11-28 18:12:40,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:40,207 INFO L225 Difference]: With dead ends: 1304 [2019-11-28 18:12:40,208 INFO L226 Difference]: Without dead ends: 1234 [2019-11-28 18:12:40,209 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-11-28 18:12:40,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2019-11-28 18:12:40,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 653. [2019-11-28 18:12:40,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 653 states. [2019-11-28 18:12:40,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 1389 transitions. [2019-11-28 18:12:40,227 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 1389 transitions. Word has length 42 [2019-11-28 18:12:40,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:40,228 INFO L462 AbstractCegarLoop]: Abstraction has 653 states and 1389 transitions. [2019-11-28 18:12:40,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 18:12:40,228 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 1389 transitions. [2019-11-28 18:12:40,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 18:12:40,231 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:40,231 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] [2019-11-28 18:12:40,231 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:40,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:40,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1291977043, now seen corresponding path program 2 times [2019-11-28 18:12:40,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:40,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005185668] [2019-11-28 18:12:40,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:40,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:40,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:40,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005185668] [2019-11-28 18:12:40,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:40,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:12:40,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307320888] [2019-11-28 18:12:40,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:12:40,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:40,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:12:40,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:12:40,398 INFO L87 Difference]: Start difference. First operand 653 states and 1389 transitions. Second operand 5 states. [2019-11-28 18:12:40,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:40,438 INFO L93 Difference]: Finished difference Result 1060 states and 2280 transitions. [2019-11-28 18:12:40,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:12:40,439 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-11-28 18:12:40,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:40,440 INFO L225 Difference]: With dead ends: 1060 [2019-11-28 18:12:40,440 INFO L226 Difference]: Without dead ends: 426 [2019-11-28 18:12:40,440 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:12:40,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2019-11-28 18:12:40,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2019-11-28 18:12:40,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-11-28 18:12:40,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 922 transitions. [2019-11-28 18:12:40,451 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 922 transitions. Word has length 42 [2019-11-28 18:12:40,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:40,453 INFO L462 AbstractCegarLoop]: Abstraction has 426 states and 922 transitions. [2019-11-28 18:12:40,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:12:40,453 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 922 transitions. [2019-11-28 18:12:40,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 18:12:40,456 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:40,456 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:12:40,456 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:40,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:40,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1278221311, now seen corresponding path program 3 times [2019-11-28 18:12:40,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:40,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931455105] [2019-11-28 18:12:40,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:40,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:12:40,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:12:40,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931455105] [2019-11-28 18:12:40,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:12:40,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:12:40,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71454988] [2019-11-28 18:12:40,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:12:40,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:12:40,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:12:40,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:12:40,652 INFO L87 Difference]: Start difference. First operand 426 states and 922 transitions. Second operand 7 states. [2019-11-28 18:12:40,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:12:40,928 INFO L93 Difference]: Finished difference Result 818 states and 1725 transitions. [2019-11-28 18:12:40,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 18:12:40,929 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2019-11-28 18:12:40,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:12:40,930 INFO L225 Difference]: With dead ends: 818 [2019-11-28 18:12:40,930 INFO L226 Difference]: Without dead ends: 532 [2019-11-28 18:12:40,930 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-11-28 18:12:40,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-11-28 18:12:40,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 474. [2019-11-28 18:12:40,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2019-11-28 18:12:40,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 996 transitions. [2019-11-28 18:12:40,940 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 996 transitions. Word has length 42 [2019-11-28 18:12:40,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:12:40,940 INFO L462 AbstractCegarLoop]: Abstraction has 474 states and 996 transitions. [2019-11-28 18:12:40,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:12:40,941 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 996 transitions. [2019-11-28 18:12:40,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 18:12:40,943 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:12:40,943 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] [2019-11-28 18:12:40,943 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:12:40,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:12:40,943 INFO L82 PathProgramCache]: Analyzing trace with hash 416077471, now seen corresponding path program 4 times [2019-11-28 18:12:40,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:12:40,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268222354] [2019-11-28 18:12:40,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:12:40,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:12:41,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:12:41,076 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:12:41,076 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:12:41,080 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_56| 0 0))) (and (= v_~x$r_buff1_thd1~0_310 0) (= 0 v_~weak$$choice0~0_10) (= 0 v_~x$w_buff1~0_306) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t903~0.base_31|) (= 0 v_~__unbuffered_p1_EBX~0_149) (= v_~z~0_67 0) (= 0 v_~__unbuffered_cnt~0_92) (= 0 |v_ULTIMATE.start_main_~#t903~0.offset_23|) (= 0 v_~x$r_buff1_thd2~0_200) (= (select .cse0 |v_ULTIMATE.start_main_~#t903~0.base_31|) 0) (= v_~x$r_buff1_thd0~0_197 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t903~0.base_31| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t903~0.base_31|) |v_ULTIMATE.start_main_~#t903~0.offset_23| 0)) |v_#memory_int_17|) (= 0 v_~x$read_delayed_var~0.base_7) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t903~0.base_31| 4) |v_#length_17|) (= 0 v_~x$read_delayed~0_6) (= v_~x$flush_delayed~0_43 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~main$tmp_guard0~0_20 0) (= v_~x$r_buff0_thd0~0_141 0) (= v_~weak$$choice2~0_165 0) (= v_~x$r_buff0_thd1~0_354 0) (= |v_#NULL.offset_5| 0) (= 0 v_~x$r_buff0_thd2~0_271) (= 0 v_~x~0_132) (= 0 v_~x$w_buff0~0_467) (= (store .cse0 |v_ULTIMATE.start_main_~#t903~0.base_31| 1) |v_#valid_54|) (= v_~x$mem_tmp~0_11 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~main$tmp_guard1~0_24 0) (= 0 v_~__unbuffered_p0_EAX~0_51) (= 0 v_~x$w_buff1_used~0_505) (= v_~__unbuffered_p1_EAX~0_149 0) (= v_~y~0_138 0) (= 0 |v_#NULL.base_5|) (= 0 v_~x$w_buff0_used~0_795))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_467, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_354, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_20|, ~x$flush_delayed~0=v_~x$flush_delayed~0_43, ULTIMATE.start_main_~#t904~0.base=|v_ULTIMATE.start_main_~#t904~0.base_28|, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_310, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_51, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_149, ULTIMATE.start_main_~#t903~0.offset=|v_ULTIMATE.start_main_~#t903~0.offset_23|, #length=|v_#length_17|, ~y~0=v_~y~0_138, ULTIMATE.start_main_~#t903~0.base=|v_ULTIMATE.start_main_~#t903~0.base_31|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_141, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_149, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_50|, ~x$w_buff1~0=v_~x$w_buff1~0_306, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_32|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_160|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_505, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_200, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_36|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_60|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_197, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_271, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_42|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_795, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t904~0.offset=|v_ULTIMATE.start_main_~#t904~0.offset_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_92, ~z~0=v_~z~0_67, ~weak$$choice2~0=v_~weak$$choice2~0_165, ~x~0=v_~x~0_132, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~nondet32, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet33, ~x$flush_delayed~0, ULTIMATE.start_main_~#t904~0.base, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t903~0.offset, #length, ~y~0, ULTIMATE.start_main_~#t903~0.base, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ~weak$$choice0~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t904~0.offset, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-11-28 18:12:41,081 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L800-1-->L802: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t904~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t904~0.base_12|) |v_ULTIMATE.start_main_~#t904~0.offset_11| 1)) |v_#memory_int_11|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t904~0.base_12| 1)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t904~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t904~0.offset_11|) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t904~0.base_12| 4)) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t904~0.base_12|)) (not (= |v_ULTIMATE.start_main_~#t904~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t904~0.base=|v_ULTIMATE.start_main_~#t904~0.base_12|, ULTIMATE.start_main_~#t904~0.offset=|v_ULTIMATE.start_main_~#t904~0.offset_11|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, ULTIMATE.start_main_~#t904~0.base, ULTIMATE.start_main_~#t904~0.offset, #length] because there is no mapped edge [2019-11-28 18:12:41,082 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [578] [578] P1ENTRY-->L5-3: Formula: (and (= v_P1Thread1of1ForFork0_~arg.base_19 |v_P1Thread1of1ForFork0_#in~arg.base_21|) (= v_~x$w_buff0~0_50 v_~x$w_buff1~0_30) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_21 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_19|) (= 1 v_~x$w_buff0_used~0_94) (not (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_21 0)) (= 1 v_~x$w_buff0~0_49) (= |v_P1Thread1of1ForFork0_#in~arg.offset_21| v_P1Thread1of1ForFork0_~arg.offset_19) (= v_~x$w_buff1_used~0_53 v_~x$w_buff0_used~0_95) (= (ite (not (and (not (= 0 (mod v_~x$w_buff0_used~0_94 256))) (not (= (mod v_~x$w_buff1_used~0_53 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_19|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_50, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_21|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_21|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_95} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_49, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_21, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_19, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_19, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_21|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_19|, ~x$w_buff1~0=v_~x$w_buff1~0_30, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_21|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-11-28 18:12:41,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [637] [637] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1360079392 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1360079392 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite28_Out-1360079392| ~x$w_buff0_used~0_In-1360079392) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork0_#t~ite28_Out-1360079392| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1360079392, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1360079392} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1360079392, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-1360079392|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1360079392} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-11-28 18:12:41,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [635] [635] L779-->L779-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1665365289 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-1665365289 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In-1665365289 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1665365289 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-1665365289 |P1Thread1of1ForFork0_#t~ite29_Out-1665365289|)) (and (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-1665365289|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1665365289, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1665365289, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1665365289, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1665365289} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1665365289, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1665365289, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1665365289, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-1665365289|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1665365289} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-11-28 18:12:41,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L780-->L781: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-1031851869 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-1031851869 256) 0)) (.cse2 (= ~x$r_buff0_thd2~0_In-1031851869 ~x$r_buff0_thd2~0_Out-1031851869))) (or (and (not .cse0) (= 0 ~x$r_buff0_thd2~0_Out-1031851869) (not .cse1)) (and .cse0 .cse2) (and .cse1 .cse2))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1031851869, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1031851869} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-1031851869|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1031851869, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1031851869} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-11-28 18:12:41,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] L781-->L781-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd2~0_In-838504287 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-838504287 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-838504287 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In-838504287 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite31_Out-838504287| ~x$r_buff1_thd2~0_In-838504287) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite31_Out-838504287| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-838504287, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-838504287, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-838504287, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-838504287} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-838504287|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-838504287, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-838504287, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-838504287, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-838504287} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-11-28 18:12:41,087 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L781-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= v_~x$r_buff1_thd2~0_114 |v_P1Thread1of1ForFork0_#t~ite31_34|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_33|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_114, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-11-28 18:12:41,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [588] [588] L741-->L742: Formula: (and (not (= (mod v_~weak$$choice2~0_19 256) 0)) (= v_~x$r_buff0_thd1~0_67 v_~x$r_buff0_thd1~0_66)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_67, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_7|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_66, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_6|, ~weak$$choice2~0=v_~weak$$choice2~0_19} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-11-28 18:12:41,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L744-->L752: Formula: (and (= v_~x$mem_tmp~0_6 v_~x~0_51) (not (= 0 (mod v_~x$flush_delayed~0_22 256))) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35) (= v_~x$flush_delayed~0_21 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_22, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36, ~x$mem_tmp~0=v_~x$mem_tmp~0_6} OutVars{P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_27|, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, ~x$mem_tmp~0=v_~x$mem_tmp~0_6, ~x~0=v_~x~0_51} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-11-28 18:12:41,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [600] [600] L802-1-->L808: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_12) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-11-28 18:12:41,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L808-2-->L808-4: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In-315591699 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-315591699 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite34_Out-315591699| ~x~0_In-315591699)) (and (= |ULTIMATE.start_main_#t~ite34_Out-315591699| ~x$w_buff1~0_In-315591699) (not .cse1) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-315591699, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-315591699, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-315591699, ~x~0=~x~0_In-315591699} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-315591699, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-315591699, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-315591699, ~x~0=~x~0_In-315591699, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-315591699|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-11-28 18:12:41,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [596] [596] L808-4-->L809: Formula: (= v_~x~0_24 |v_ULTIMATE.start_main_#t~ite34_9|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_9|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_12|, ~x~0=v_~x~0_24, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~x~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-11-28 18:12:41,092 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L809-->L809-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In265940792 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In265940792 256)))) (or (and (= |ULTIMATE.start_main_#t~ite36_Out265940792| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite36_Out265940792| ~x$w_buff0_used~0_In265940792) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In265940792, ~x$w_buff0_used~0=~x$w_buff0_used~0_In265940792} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In265940792, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out265940792|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In265940792} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-11-28 18:12:41,093 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L810-->L810-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd0~0_In-28679578 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-28679578 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-28679578 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-28679578 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite37_Out-28679578| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite37_Out-28679578| ~x$w_buff1_used~0_In-28679578) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-28679578, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-28679578, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-28679578, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-28679578} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-28679578, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-28679578, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-28679578|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-28679578, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-28679578} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:12:41,093 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L811-->L811-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1548206200 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1548206200 256)))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out-1548206200| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite38_Out-1548206200| ~x$r_buff0_thd0~0_In-1548206200) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1548206200, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1548206200} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1548206200, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1548206200|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1548206200} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:12:41,094 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L812-->L812-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-975221499 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-975221499 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In-975221499 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-975221499 256)))) (or (and (= ~x$r_buff1_thd0~0_In-975221499 |ULTIMATE.start_main_#t~ite39_Out-975221499|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite39_Out-975221499|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-975221499, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-975221499, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-975221499, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-975221499} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-975221499, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-975221499|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-975221499, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-975221499, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-975221499} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:12:41,094 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L812-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~x$r_buff1_thd0~0_183 |v_ULTIMATE.start_main_#t~ite39_36|) (= v_~main$tmp_guard1~0_17 (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p1_EBX~0_136) (= v_~__unbuffered_p1_EAX~0_136 1) (= 0 v_~__unbuffered_p0_EAX~0_38))) 1 0)) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_38, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_136, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_136, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_36|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_38, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_136, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_136, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_35|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_183, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:12:41,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:12:41 BasicIcfg [2019-11-28 18:12:41,193 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:12:41,194 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:12:41,194 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:12:41,195 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:12:41,195 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:12:27" (3/4) ... [2019-11-28 18:12:41,197 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:12:41,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_56| 0 0))) (and (= v_~x$r_buff1_thd1~0_310 0) (= 0 v_~weak$$choice0~0_10) (= 0 v_~x$w_buff1~0_306) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t903~0.base_31|) (= 0 v_~__unbuffered_p1_EBX~0_149) (= v_~z~0_67 0) (= 0 v_~__unbuffered_cnt~0_92) (= 0 |v_ULTIMATE.start_main_~#t903~0.offset_23|) (= 0 v_~x$r_buff1_thd2~0_200) (= (select .cse0 |v_ULTIMATE.start_main_~#t903~0.base_31|) 0) (= v_~x$r_buff1_thd0~0_197 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t903~0.base_31| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t903~0.base_31|) |v_ULTIMATE.start_main_~#t903~0.offset_23| 0)) |v_#memory_int_17|) (= 0 v_~x$read_delayed_var~0.base_7) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t903~0.base_31| 4) |v_#length_17|) (= 0 v_~x$read_delayed~0_6) (= v_~x$flush_delayed~0_43 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~main$tmp_guard0~0_20 0) (= v_~x$r_buff0_thd0~0_141 0) (= v_~weak$$choice2~0_165 0) (= v_~x$r_buff0_thd1~0_354 0) (= |v_#NULL.offset_5| 0) (= 0 v_~x$r_buff0_thd2~0_271) (= 0 v_~x~0_132) (= 0 v_~x$w_buff0~0_467) (= (store .cse0 |v_ULTIMATE.start_main_~#t903~0.base_31| 1) |v_#valid_54|) (= v_~x$mem_tmp~0_11 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~main$tmp_guard1~0_24 0) (= 0 v_~__unbuffered_p0_EAX~0_51) (= 0 v_~x$w_buff1_used~0_505) (= v_~__unbuffered_p1_EAX~0_149 0) (= v_~y~0_138 0) (= 0 |v_#NULL.base_5|) (= 0 v_~x$w_buff0_used~0_795))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_467, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_354, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_20|, ~x$flush_delayed~0=v_~x$flush_delayed~0_43, ULTIMATE.start_main_~#t904~0.base=|v_ULTIMATE.start_main_~#t904~0.base_28|, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_310, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ~x$mem_tmp~0=v_~x$mem_tmp~0_11, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_51, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_149, ULTIMATE.start_main_~#t903~0.offset=|v_ULTIMATE.start_main_~#t903~0.offset_23|, #length=|v_#length_17|, ~y~0=v_~y~0_138, ULTIMATE.start_main_~#t903~0.base=|v_ULTIMATE.start_main_~#t903~0.base_31|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_141, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_149, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_50|, ~x$w_buff1~0=v_~x$w_buff1~0_306, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_32|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_160|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_505, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_200, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_36|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_60|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_197, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_271, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_42|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_795, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t904~0.offset=|v_ULTIMATE.start_main_~#t904~0.offset_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_92, ~z~0=v_~z~0_67, ~weak$$choice2~0=v_~weak$$choice2~0_165, ~x~0=v_~x~0_132, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~nondet32, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet33, ~x$flush_delayed~0, ULTIMATE.start_main_~#t904~0.base, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t903~0.offset, #length, ~y~0, ULTIMATE.start_main_~#t903~0.base, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ~weak$$choice0~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t904~0.offset, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-11-28 18:12:41,199 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L800-1-->L802: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t904~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t904~0.base_12|) |v_ULTIMATE.start_main_~#t904~0.offset_11| 1)) |v_#memory_int_11|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t904~0.base_12| 1)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t904~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t904~0.offset_11|) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t904~0.base_12| 4)) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t904~0.base_12|)) (not (= |v_ULTIMATE.start_main_~#t904~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t904~0.base=|v_ULTIMATE.start_main_~#t904~0.base_12|, ULTIMATE.start_main_~#t904~0.offset=|v_ULTIMATE.start_main_~#t904~0.offset_11|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, ULTIMATE.start_main_~#t904~0.base, ULTIMATE.start_main_~#t904~0.offset, #length] because there is no mapped edge [2019-11-28 18:12:41,199 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [578] [578] P1ENTRY-->L5-3: Formula: (and (= v_P1Thread1of1ForFork0_~arg.base_19 |v_P1Thread1of1ForFork0_#in~arg.base_21|) (= v_~x$w_buff0~0_50 v_~x$w_buff1~0_30) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_21 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_19|) (= 1 v_~x$w_buff0_used~0_94) (not (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_21 0)) (= 1 v_~x$w_buff0~0_49) (= |v_P1Thread1of1ForFork0_#in~arg.offset_21| v_P1Thread1of1ForFork0_~arg.offset_19) (= v_~x$w_buff1_used~0_53 v_~x$w_buff0_used~0_95) (= (ite (not (and (not (= 0 (mod v_~x$w_buff0_used~0_94 256))) (not (= (mod v_~x$w_buff1_used~0_53 256) 0)))) 1 0) |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_19|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_50, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_21|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_21|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_95} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_49, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_21, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_19, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_19, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_21|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_19|, ~x$w_buff1~0=v_~x$w_buff1~0_30, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_21|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_53, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_94} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-11-28 18:12:41,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [637] [637] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1360079392 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1360079392 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite28_Out-1360079392| ~x$w_buff0_used~0_In-1360079392) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork0_#t~ite28_Out-1360079392| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1360079392, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1360079392} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1360079392, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-1360079392|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1360079392} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-11-28 18:12:41,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [635] [635] L779-->L779-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1665365289 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-1665365289 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In-1665365289 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1665365289 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-1665365289 |P1Thread1of1ForFork0_#t~ite29_Out-1665365289|)) (and (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-1665365289|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1665365289, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1665365289, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1665365289, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1665365289} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1665365289, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1665365289, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1665365289, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-1665365289|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1665365289} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-11-28 18:12:41,202 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L780-->L781: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-1031851869 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-1031851869 256) 0)) (.cse2 (= ~x$r_buff0_thd2~0_In-1031851869 ~x$r_buff0_thd2~0_Out-1031851869))) (or (and (not .cse0) (= 0 ~x$r_buff0_thd2~0_Out-1031851869) (not .cse1)) (and .cse0 .cse2) (and .cse1 .cse2))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1031851869, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1031851869} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-1031851869|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1031851869, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1031851869} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-11-28 18:12:41,202 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [638] [638] L781-->L781-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd2~0_In-838504287 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-838504287 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-838504287 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In-838504287 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite31_Out-838504287| ~x$r_buff1_thd2~0_In-838504287) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite31_Out-838504287| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-838504287, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-838504287, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-838504287, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-838504287} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-838504287|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-838504287, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-838504287, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-838504287, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-838504287} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-11-28 18:12:41,202 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L781-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= v_~x$r_buff1_thd2~0_114 |v_P1Thread1of1ForFork0_#t~ite31_34|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_33|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_114, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-11-28 18:12:41,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [588] [588] L741-->L742: Formula: (and (not (= (mod v_~weak$$choice2~0_19 256) 0)) (= v_~x$r_buff0_thd1~0_67 v_~x$r_buff0_thd1~0_66)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_67, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_7|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_66, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_6|, ~weak$$choice2~0=v_~weak$$choice2~0_19} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-11-28 18:12:41,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L744-->L752: Formula: (and (= v_~x$mem_tmp~0_6 v_~x~0_51) (not (= 0 (mod v_~x$flush_delayed~0_22 256))) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35) (= v_~x$flush_delayed~0_21 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_22, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36, ~x$mem_tmp~0=v_~x$mem_tmp~0_6} OutVars{P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_27|, ~x$flush_delayed~0=v_~x$flush_delayed~0_21, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, ~x$mem_tmp~0=v_~x$mem_tmp~0_6, ~x~0=v_~x~0_51} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-11-28 18:12:41,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [600] [600] L802-1-->L808: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_12) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-11-28 18:12:41,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L808-2-->L808-4: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In-315591699 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-315591699 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite34_Out-315591699| ~x~0_In-315591699)) (and (= |ULTIMATE.start_main_#t~ite34_Out-315591699| ~x$w_buff1~0_In-315591699) (not .cse1) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-315591699, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-315591699, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-315591699, ~x~0=~x~0_In-315591699} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-315591699, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-315591699, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-315591699, ~x~0=~x~0_In-315591699, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-315591699|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-11-28 18:12:41,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [596] [596] L808-4-->L809: Formula: (= v_~x~0_24 |v_ULTIMATE.start_main_#t~ite34_9|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_9|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_12|, ~x~0=v_~x~0_24, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~x~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-11-28 18:12:41,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L809-->L809-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In265940792 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In265940792 256)))) (or (and (= |ULTIMATE.start_main_#t~ite36_Out265940792| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite36_Out265940792| ~x$w_buff0_used~0_In265940792) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In265940792, ~x$w_buff0_used~0=~x$w_buff0_used~0_In265940792} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In265940792, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out265940792|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In265940792} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-11-28 18:12:41,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L810-->L810-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd0~0_In-28679578 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-28679578 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-28679578 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-28679578 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite37_Out-28679578| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite37_Out-28679578| ~x$w_buff1_used~0_In-28679578) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-28679578, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-28679578, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-28679578, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-28679578} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-28679578, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-28679578, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-28679578|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-28679578, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-28679578} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:12:41,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L811-->L811-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1548206200 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1548206200 256)))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out-1548206200| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite38_Out-1548206200| ~x$r_buff0_thd0~0_In-1548206200) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1548206200, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1548206200} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1548206200, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1548206200|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1548206200} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:12:41,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L812-->L812-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-975221499 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-975221499 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In-975221499 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-975221499 256)))) (or (and (= ~x$r_buff1_thd0~0_In-975221499 |ULTIMATE.start_main_#t~ite39_Out-975221499|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite39_Out-975221499|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-975221499, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-975221499, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-975221499, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-975221499} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-975221499, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-975221499|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-975221499, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-975221499, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-975221499} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:12:41,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L812-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~x$r_buff1_thd0~0_183 |v_ULTIMATE.start_main_#t~ite39_36|) (= v_~main$tmp_guard1~0_17 (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p1_EBX~0_136) (= v_~__unbuffered_p1_EAX~0_136 1) (= 0 v_~__unbuffered_p0_EAX~0_38))) 1 0)) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_38, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_136, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_136, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_36|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_38, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_136, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_136, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_35|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_183, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:12:41,283 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:12:41,284 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:12:41,286 INFO L168 Benchmark]: Toolchain (without parser) took 15468.02 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 495.5 MB). Free memory was 955.0 MB in the beginning and 1.4 GB in the end (delta: -399.6 MB). Peak memory consumption was 95.8 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:41,286 INFO L168 Benchmark]: CDTParser took 0.40 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:12:41,287 INFO L168 Benchmark]: CACSL2BoogieTranslator took 841.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -150.6 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:41,287 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.14 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-11-28 18:12:41,288 INFO L168 Benchmark]: Boogie Preprocessor took 36.44 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:41,288 INFO L168 Benchmark]: RCFGBuilder took 709.16 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: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:41,289 INFO L168 Benchmark]: TraceAbstraction took 13720.90 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 350.2 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -314.4 MB). Peak memory consumption was 35.9 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:41,290 INFO L168 Benchmark]: Witness Printer took 89.45 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 11.5 GB. [2019-11-28 18:12:41,293 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.40 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 841.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -150.6 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 61.14 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. * Boogie Preprocessor took 36.44 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 709.16 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: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13720.90 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 350.2 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -314.4 MB). Peak memory consumption was 35.9 MB. Max. memory is 11.5 GB. * Witness Printer took 89.45 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.1s, 137 ProgramPointsBefore, 67 ProgramPointsAfterwards, 165 TransitionsBefore, 80 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 8 FixpointIterations, 31 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 18 ChoiceCompositions, 4487 VarBasedMoverChecksPositive, 218 VarBasedMoverChecksNegative, 83 SemBasedMoverChecksPositive, 190 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 45287 CheckedPairsTotal, 103 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L800] FCALL, FORK 0 pthread_create(&t903, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L802] FCALL, FORK 0 pthread_create(&t904, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L762] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L763] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L764] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L765] 2 x$r_buff0_thd2 = (_Bool)1 [L768] 2 y = 1 [L771] 2 __unbuffered_p1_EAX = y [L774] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L729] 1 z = 1 [L732] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L733] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L734] 1 x$flush_delayed = weak$$choice2 [L735] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L736] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L777] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L736] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L737] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __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 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L737] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L738] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __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 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L738] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L739] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __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 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L739] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L740] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __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 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L740] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L742] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __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 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L742] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __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=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L808] 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L809] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L810] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L811] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 131 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.4s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1285 SDtfs, 1374 SDslu, 2050 SDs, 0 SdLazy, 804 SolverSat, 79 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 16 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10970occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.8s AutomataMinimizationTime, 13 MinimizatonAttempts, 6427 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 328 NumberOfCodeBlocks, 328 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 273 ConstructedInterpolants, 0 QuantifiedInterpolants, 58586 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...