./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/rfi007_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/rfi007_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 ba285cceecb5b920bb647903ab6e1e54ede4b67e ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:23:25,528 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:23:25,531 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:23:25,549 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:23:25,550 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:23:25,552 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:23:25,554 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:23:25,564 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:23:25,569 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:23:25,572 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:23:25,573 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:23:25,575 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:23:25,575 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:23:25,579 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:23:25,581 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:23:25,582 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:23:25,584 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:23:25,585 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:23:25,587 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:23:25,591 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:23:25,596 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:23:25,600 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:23:25,601 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:23:25,603 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:23:25,605 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:23:25,605 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:23:25,606 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:23:25,608 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:23:25,608 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:23:25,609 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:23:25,609 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:23:25,610 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:23:25,611 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:23:25,612 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:23:25,613 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:23:25,613 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:23:25,615 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:23:25,615 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:23:25,615 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:23:25,616 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:23:25,617 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:23:25,618 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:23:25,651 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:23:25,651 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:23:25,654 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:23:25,658 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:23:25,658 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:23:25,660 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:23:25,660 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:23:25,660 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:23:25,661 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:23:25,661 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:23:25,661 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:23:25,661 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:23:25,662 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:23:25,662 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:23:25,662 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:23:25,662 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:23:25,662 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:23:25,663 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:23:25,663 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:23:25,663 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:23:25,663 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:23:25,664 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:23:25,664 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:23:25,664 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:23:25,664 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:23:25,665 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:23:25,665 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:23:25,665 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:23:25,665 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:23:25,665 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 -> ba285cceecb5b920bb647903ab6e1e54ede4b67e [2019-11-28 18:23:25,974 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:23:25,987 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:23:25,991 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:23:25,993 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:23:25,993 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:23:25,994 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/rfi007_pso.opt.i [2019-11-28 18:23:26,064 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/298ce9ca0/bd96f8b906394a108448fa6f5fcd78c2/FLAG4133cd350 [2019-11-28 18:23:26,706 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:23:26,708 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi007_pso.opt.i [2019-11-28 18:23:26,732 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/298ce9ca0/bd96f8b906394a108448fa6f5fcd78c2/FLAG4133cd350 [2019-11-28 18:23:26,888 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/298ce9ca0/bd96f8b906394a108448fa6f5fcd78c2 [2019-11-28 18:23:26,892 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:23:26,894 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:23:26,896 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:23:26,896 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:23:26,900 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:23:26,901 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:23:26" (1/1) ... [2019-11-28 18:23:26,904 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dc5c18f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:26, skipping insertion in model container [2019-11-28 18:23:26,904 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:23:26" (1/1) ... [2019-11-28 18:23:26,913 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:23:26,977 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:23:27,531 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:23:27,552 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:23:27,620 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:23:27,704 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:23:27,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:27 WrapperNode [2019-11-28 18:23:27,705 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:23:27,706 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:23:27,706 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:23:27,706 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:23:27,713 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:23:27" (1/1) ... [2019-11-28 18:23:27,733 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:23:27" (1/1) ... [2019-11-28 18:23:27,768 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:23:27,768 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:23:27,768 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:23:27,768 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:23:27,777 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:27" (1/1) ... [2019-11-28 18:23:27,777 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:27" (1/1) ... [2019-11-28 18:23:27,782 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:27" (1/1) ... [2019-11-28 18:23:27,783 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:27" (1/1) ... [2019-11-28 18:23:27,793 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:27" (1/1) ... [2019-11-28 18:23:27,797 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:27" (1/1) ... [2019-11-28 18:23:27,800 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:27" (1/1) ... [2019-11-28 18:23:27,805 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:23:27,806 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:23:27,806 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:23:27,806 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:23:27,807 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:27" (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:23:27,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:23:27,881 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:23:27,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:23:27,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:23:27,882 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:23:27,882 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:23:27,882 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:23:27,883 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:23:27,883 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:23:27,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:23:27,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:23:27,885 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:23:28,616 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:23:28,617 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:23:28,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:23:28 BoogieIcfgContainer [2019-11-28 18:23:28,619 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:23:28,620 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:23:28,620 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:23:28,625 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:23:28,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:23:26" (1/3) ... [2019-11-28 18:23:28,627 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ebbfefa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:23:28, skipping insertion in model container [2019-11-28 18:23:28,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:23:27" (2/3) ... [2019-11-28 18:23:28,629 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ebbfefa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:23:28, skipping insertion in model container [2019-11-28 18:23:28,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:23:28" (3/3) ... [2019-11-28 18:23:28,632 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi007_pso.opt.i [2019-11-28 18:23:28,646 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:23:28,646 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:23:28,658 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:23:28,659 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:23:28,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,700 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,700 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,701 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,701 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,701 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,711 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,711 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,751 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:23:28,785 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-28 18:23:28,805 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:23:28,805 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:23:28,805 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:23:28,805 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:23:28,805 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:23:28,805 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:23:28,805 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:23:28,806 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:23:28,823 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-11-28 18:23:28,825 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-11-28 18:23:28,934 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-11-28 18:23:28,934 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:23:28,955 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 560 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:23:28,976 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-11-28 18:23:29,066 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-11-28 18:23:29,067 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:23:29,073 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 560 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:23:29,091 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-11-28 18:23:29,092 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:23:33,737 WARN L192 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-11-28 18:23:33,877 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-28 18:23:34,239 INFO L206 etLargeBlockEncoding]: Checked pairs total: 76691 [2019-11-28 18:23:34,239 INFO L214 etLargeBlockEncoding]: Total number of compositions: 108 [2019-11-28 18:23:34,243 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 90 transitions [2019-11-28 18:23:34,945 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9438 states. [2019-11-28 18:23:34,949 INFO L276 IsEmpty]: Start isEmpty. Operand 9438 states. [2019-11-28 18:23:34,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-11-28 18:23:34,959 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:23:34,960 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-11-28 18:23:34,961 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:23:34,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:23:34,969 INFO L82 PathProgramCache]: Analyzing trace with hash 790297, now seen corresponding path program 1 times [2019-11-28 18:23:34,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:23:34,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305256349] [2019-11-28 18:23:34,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:23:35,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:23:35,320 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:23:35,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305256349] [2019-11-28 18:23:35,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:23:35,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:23:35,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562357339] [2019-11-28 18:23:35,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:23:35,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:23:35,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:23:35,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:23:35,348 INFO L87 Difference]: Start difference. First operand 9438 states. Second operand 3 states. [2019-11-28 18:23:35,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:23:35,646 INFO L93 Difference]: Finished difference Result 9266 states and 29920 transitions. [2019-11-28 18:23:35,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:23:35,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-11-28 18:23:35,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:23:35,788 INFO L225 Difference]: With dead ends: 9266 [2019-11-28 18:23:35,788 INFO L226 Difference]: Without dead ends: 8258 [2019-11-28 18:23:35,790 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:23:36,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8258 states. [2019-11-28 18:23:36,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8258 to 8258. [2019-11-28 18:23:36,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8258 states. [2019-11-28 18:23:36,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8258 states to 8258 states and 26572 transitions. [2019-11-28 18:23:36,362 INFO L78 Accepts]: Start accepts. Automaton has 8258 states and 26572 transitions. Word has length 3 [2019-11-28 18:23:36,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:23:36,363 INFO L462 AbstractCegarLoop]: Abstraction has 8258 states and 26572 transitions. [2019-11-28 18:23:36,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:23:36,363 INFO L276 IsEmpty]: Start isEmpty. Operand 8258 states and 26572 transitions. [2019-11-28 18:23:36,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 18:23:36,370 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:23:36,370 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:23:36,371 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:23:36,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:23:36,371 INFO L82 PathProgramCache]: Analyzing trace with hash 316025548, now seen corresponding path program 1 times [2019-11-28 18:23:36,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:23:36,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088115577] [2019-11-28 18:23:36,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:23:36,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:23:36,543 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:23:36,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088115577] [2019-11-28 18:23:36,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:23:36,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:23:36,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745225693] [2019-11-28 18:23:36,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:23:36,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:23:36,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:23:36,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:23:36,547 INFO L87 Difference]: Start difference. First operand 8258 states and 26572 transitions. Second operand 4 states. [2019-11-28 18:23:37,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:23:37,179 INFO L93 Difference]: Finished difference Result 12603 states and 38772 transitions. [2019-11-28 18:23:37,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:23:37,180 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 18:23:37,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:23:37,272 INFO L225 Difference]: With dead ends: 12603 [2019-11-28 18:23:37,272 INFO L226 Difference]: Without dead ends: 12589 [2019-11-28 18:23:37,274 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:23:37,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12589 states. [2019-11-28 18:23:37,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12589 to 11299. [2019-11-28 18:23:37,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11299 states. [2019-11-28 18:23:37,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11299 states to 11299 states and 35365 transitions. [2019-11-28 18:23:37,681 INFO L78 Accepts]: Start accepts. Automaton has 11299 states and 35365 transitions. Word has length 11 [2019-11-28 18:23:37,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:23:37,681 INFO L462 AbstractCegarLoop]: Abstraction has 11299 states and 35365 transitions. [2019-11-28 18:23:37,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:23:37,681 INFO L276 IsEmpty]: Start isEmpty. Operand 11299 states and 35365 transitions. [2019-11-28 18:23:37,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:23:37,686 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:23:37,686 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:23:37,687 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:23:37,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:23:37,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1209477957, now seen corresponding path program 1 times [2019-11-28 18:23:37,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:23:37,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917719726] [2019-11-28 18:23:37,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:23:37,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:23:37,808 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:23:37,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917719726] [2019-11-28 18:23:37,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:23:37,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:23:37,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215680076] [2019-11-28 18:23:37,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:23:37,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:23:37,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:23:37,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:23:37,811 INFO L87 Difference]: Start difference. First operand 11299 states and 35365 transitions. Second operand 4 states. [2019-11-28 18:23:38,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:23:38,052 INFO L93 Difference]: Finished difference Result 13736 states and 42816 transitions. [2019-11-28 18:23:38,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:23:38,052 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:23:38,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:23:38,105 INFO L225 Difference]: With dead ends: 13736 [2019-11-28 18:23:38,106 INFO L226 Difference]: Without dead ends: 13736 [2019-11-28 18:23:38,106 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:23:38,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13736 states. [2019-11-28 18:23:38,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13736 to 12234. [2019-11-28 18:23:38,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12234 states. [2019-11-28 18:23:38,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12234 states to 12234 states and 38359 transitions. [2019-11-28 18:23:38,563 INFO L78 Accepts]: Start accepts. Automaton has 12234 states and 38359 transitions. Word has length 14 [2019-11-28 18:23:38,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:23:38,565 INFO L462 AbstractCegarLoop]: Abstraction has 12234 states and 38359 transitions. [2019-11-28 18:23:38,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:23:38,565 INFO L276 IsEmpty]: Start isEmpty. Operand 12234 states and 38359 transitions. [2019-11-28 18:23:38,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:23:38,569 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:23:38,569 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:23:38,569 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:23:38,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:23:38,569 INFO L82 PathProgramCache]: Analyzing trace with hash -572907870, now seen corresponding path program 1 times [2019-11-28 18:23:38,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:23:38,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891162703] [2019-11-28 18:23:38,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:23:38,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:23:38,617 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:23:38,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891162703] [2019-11-28 18:23:38,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:23:38,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:23:38,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059688807] [2019-11-28 18:23:38,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:23:38,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:23:38,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:23:38,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:23:38,620 INFO L87 Difference]: Start difference. First operand 12234 states and 38359 transitions. Second operand 3 states. [2019-11-28 18:23:38,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:23:38,689 INFO L93 Difference]: Finished difference Result 11576 states and 35711 transitions. [2019-11-28 18:23:38,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:23:38,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 18:23:38,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:23:38,726 INFO L225 Difference]: With dead ends: 11576 [2019-11-28 18:23:38,726 INFO L226 Difference]: Without dead ends: 11576 [2019-11-28 18:23:38,726 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:23:38,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11576 states. [2019-11-28 18:23:39,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11576 to 11496. [2019-11-28 18:23:39,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11496 states. [2019-11-28 18:23:39,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11496 states to 11496 states and 35479 transitions. [2019-11-28 18:23:39,217 INFO L78 Accepts]: Start accepts. Automaton has 11496 states and 35479 transitions. Word has length 16 [2019-11-28 18:23:39,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:23:39,217 INFO L462 AbstractCegarLoop]: Abstraction has 11496 states and 35479 transitions. [2019-11-28 18:23:39,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:23:39,218 INFO L276 IsEmpty]: Start isEmpty. Operand 11496 states and 35479 transitions. [2019-11-28 18:23:39,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:23:39,221 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:23:39,221 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:23:39,221 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:23:39,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:23:39,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1184696536, now seen corresponding path program 1 times [2019-11-28 18:23:39,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:23:39,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718226564] [2019-11-28 18:23:39,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:23:39,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:23:39,286 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:23:39,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718226564] [2019-11-28 18:23:39,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:23:39,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:23:39,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311423676] [2019-11-28 18:23:39,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:23:39,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:23:39,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:23:39,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:23:39,289 INFO L87 Difference]: Start difference. First operand 11496 states and 35479 transitions. Second operand 3 states. [2019-11-28 18:23:39,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:23:39,398 INFO L93 Difference]: Finished difference Result 19925 states and 60894 transitions. [2019-11-28 18:23:39,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:23:39,399 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 18:23:39,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:23:39,448 INFO L225 Difference]: With dead ends: 19925 [2019-11-28 18:23:39,448 INFO L226 Difference]: Without dead ends: 17497 [2019-11-28 18:23:39,449 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:23:39,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17497 states. [2019-11-28 18:23:39,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17497 to 16697. [2019-11-28 18:23:39,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16697 states. [2019-11-28 18:23:39,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16697 states to 16697 states and 51504 transitions. [2019-11-28 18:23:39,953 INFO L78 Accepts]: Start accepts. Automaton has 16697 states and 51504 transitions. Word has length 16 [2019-11-28 18:23:39,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:23:39,953 INFO L462 AbstractCegarLoop]: Abstraction has 16697 states and 51504 transitions. [2019-11-28 18:23:39,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:23:39,954 INFO L276 IsEmpty]: Start isEmpty. Operand 16697 states and 51504 transitions. [2019-11-28 18:23:39,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 18:23:39,960 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:23:39,960 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:23:39,960 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:23:39,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:23:39,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1923749814, now seen corresponding path program 1 times [2019-11-28 18:23:39,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:23:39,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2974656] [2019-11-28 18:23:39,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:23:39,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:23:40,025 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:23:40,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2974656] [2019-11-28 18:23:40,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:23:40,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:23:40,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941012531] [2019-11-28 18:23:40,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:23:40,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:23:40,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:23:40,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:23:40,028 INFO L87 Difference]: Start difference. First operand 16697 states and 51504 transitions. Second operand 4 states. [2019-11-28 18:23:40,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:23:40,064 INFO L93 Difference]: Finished difference Result 3027 states and 7631 transitions. [2019-11-28 18:23:40,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:23:40,065 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-28 18:23:40,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:23:40,069 INFO L225 Difference]: With dead ends: 3027 [2019-11-28 18:23:40,070 INFO L226 Difference]: Without dead ends: 2101 [2019-11-28 18:23:40,070 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:23:40,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2101 states. [2019-11-28 18:23:40,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2101 to 2101. [2019-11-28 18:23:40,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2101 states. [2019-11-28 18:23:40,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2101 states to 2101 states and 4686 transitions. [2019-11-28 18:23:40,111 INFO L78 Accepts]: Start accepts. Automaton has 2101 states and 4686 transitions. Word has length 17 [2019-11-28 18:23:40,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:23:40,112 INFO L462 AbstractCegarLoop]: Abstraction has 2101 states and 4686 transitions. [2019-11-28 18:23:40,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:23:40,112 INFO L276 IsEmpty]: Start isEmpty. Operand 2101 states and 4686 transitions. [2019-11-28 18:23:40,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 18:23:40,115 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:23:40,115 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:23:40,116 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:23:40,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:23:40,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1133745070, now seen corresponding path program 1 times [2019-11-28 18:23:40,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:23:40,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578317680] [2019-11-28 18:23:40,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:23:40,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:23:40,270 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:23:40,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578317680] [2019-11-28 18:23:40,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:23:40,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:23:40,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187749506] [2019-11-28 18:23:40,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:23:40,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:23:40,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:23:40,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:23:40,273 INFO L87 Difference]: Start difference. First operand 2101 states and 4686 transitions. Second operand 6 states. [2019-11-28 18:23:40,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:23:40,872 INFO L93 Difference]: Finished difference Result 5510 states and 12155 transitions. [2019-11-28 18:23:40,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 18:23:40,873 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-11-28 18:23:40,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:23:40,881 INFO L225 Difference]: With dead ends: 5510 [2019-11-28 18:23:40,882 INFO L226 Difference]: Without dead ends: 5475 [2019-11-28 18:23:40,883 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-28 18:23:40,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5475 states. [2019-11-28 18:23:40,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5475 to 2768. [2019-11-28 18:23:40,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2768 states. [2019-11-28 18:23:40,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2768 states to 2768 states and 6308 transitions. [2019-11-28 18:23:40,948 INFO L78 Accepts]: Start accepts. Automaton has 2768 states and 6308 transitions. Word has length 25 [2019-11-28 18:23:40,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:23:40,948 INFO L462 AbstractCegarLoop]: Abstraction has 2768 states and 6308 transitions. [2019-11-28 18:23:40,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:23:40,949 INFO L276 IsEmpty]: Start isEmpty. Operand 2768 states and 6308 transitions. [2019-11-28 18:23:40,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 18:23:40,955 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:23:40,955 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:23:40,955 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:23:40,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:23:40,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1963896570, now seen corresponding path program 1 times [2019-11-28 18:23:40,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:23:40,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723260330] [2019-11-28 18:23:40,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:23:41,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:23:41,104 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:23:41,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723260330] [2019-11-28 18:23:41,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:23:41,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:23:41,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283993097] [2019-11-28 18:23:41,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:23:41,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:23:41,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:23:41,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:23:41,106 INFO L87 Difference]: Start difference. First operand 2768 states and 6308 transitions. Second operand 6 states. [2019-11-28 18:23:41,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:23:41,207 INFO L93 Difference]: Finished difference Result 3644 states and 8112 transitions. [2019-11-28 18:23:41,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:23:41,208 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-11-28 18:23:41,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:23:41,214 INFO L225 Difference]: With dead ends: 3644 [2019-11-28 18:23:41,215 INFO L226 Difference]: Without dead ends: 3644 [2019-11-28 18:23:41,215 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:23:41,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3644 states. [2019-11-28 18:23:41,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3644 to 2682. [2019-11-28 18:23:41,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2682 states. [2019-11-28 18:23:41,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2682 states to 2682 states and 6069 transitions. [2019-11-28 18:23:41,280 INFO L78 Accepts]: Start accepts. Automaton has 2682 states and 6069 transitions. Word has length 26 [2019-11-28 18:23:41,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:23:41,281 INFO L462 AbstractCegarLoop]: Abstraction has 2682 states and 6069 transitions. [2019-11-28 18:23:41,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:23:41,281 INFO L276 IsEmpty]: Start isEmpty. Operand 2682 states and 6069 transitions. [2019-11-28 18:23:41,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 18:23:41,286 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:23:41,287 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:23:41,287 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:23:41,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:23:41,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1204822513, now seen corresponding path program 1 times [2019-11-28 18:23:41,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:23:41,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018720345] [2019-11-28 18:23:41,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:23:41,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:23:41,412 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:23:41,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018720345] [2019-11-28 18:23:41,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:23:41,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:23:41,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536604635] [2019-11-28 18:23:41,414 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:23:41,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:23:41,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:23:41,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:23:41,415 INFO L87 Difference]: Start difference. First operand 2682 states and 6069 transitions. Second operand 6 states. [2019-11-28 18:23:41,969 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-11-28 18:23:42,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:23:42,138 INFO L93 Difference]: Finished difference Result 4871 states and 10417 transitions. [2019-11-28 18:23:42,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 18:23:42,138 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-11-28 18:23:42,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:23:42,144 INFO L225 Difference]: With dead ends: 4871 [2019-11-28 18:23:42,145 INFO L226 Difference]: Without dead ends: 4842 [2019-11-28 18:23:42,145 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-28 18:23:42,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4842 states. [2019-11-28 18:23:42,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4842 to 2791. [2019-11-28 18:23:42,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2791 states. [2019-11-28 18:23:42,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2791 states to 2791 states and 6309 transitions. [2019-11-28 18:23:42,210 INFO L78 Accepts]: Start accepts. Automaton has 2791 states and 6309 transitions. Word has length 27 [2019-11-28 18:23:42,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:23:42,210 INFO L462 AbstractCegarLoop]: Abstraction has 2791 states and 6309 transitions. [2019-11-28 18:23:42,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:23:42,210 INFO L276 IsEmpty]: Start isEmpty. Operand 2791 states and 6309 transitions. [2019-11-28 18:23:42,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 18:23:42,215 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:23:42,215 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] [2019-11-28 18:23:42,216 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:23:42,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:23:42,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1234551102, now seen corresponding path program 1 times [2019-11-28 18:23:42,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:23:42,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013519399] [2019-11-28 18:23:42,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:23:42,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:23:42,304 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:23:42,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013519399] [2019-11-28 18:23:42,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:23:42,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:23:42,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9059626] [2019-11-28 18:23:42,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:23:42,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:23:42,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:23:42,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:23:42,307 INFO L87 Difference]: Start difference. First operand 2791 states and 6309 transitions. Second operand 5 states. [2019-11-28 18:23:42,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:23:42,349 INFO L93 Difference]: Finished difference Result 1485 states and 3328 transitions. [2019-11-28 18:23:42,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:23:42,350 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-11-28 18:23:42,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:23:42,352 INFO L225 Difference]: With dead ends: 1485 [2019-11-28 18:23:42,353 INFO L226 Difference]: Without dead ends: 1326 [2019-11-28 18:23:42,354 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:23:42,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2019-11-28 18:23:42,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 890. [2019-11-28 18:23:42,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2019-11-28 18:23:42,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1972 transitions. [2019-11-28 18:23:42,373 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1972 transitions. Word has length 28 [2019-11-28 18:23:42,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:23:42,374 INFO L462 AbstractCegarLoop]: Abstraction has 890 states and 1972 transitions. [2019-11-28 18:23:42,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:23:42,374 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1972 transitions. [2019-11-28 18:23:42,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:23:42,379 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:23:42,379 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:23:42,379 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:23:42,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:23:42,380 INFO L82 PathProgramCache]: Analyzing trace with hash 551725022, now seen corresponding path program 1 times [2019-11-28 18:23:42,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:23:42,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059475014] [2019-11-28 18:23:42,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:23:42,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:23:42,491 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:23:42,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059475014] [2019-11-28 18:23:42,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:23:42,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:23:42,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014130812] [2019-11-28 18:23:42,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:23:42,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:23:42,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:23:42,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:23:42,495 INFO L87 Difference]: Start difference. First operand 890 states and 1972 transitions. Second operand 3 states. [2019-11-28 18:23:42,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:23:42,550 INFO L93 Difference]: Finished difference Result 1053 states and 2295 transitions. [2019-11-28 18:23:42,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:23:42,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-28 18:23:42,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:23:42,551 INFO L225 Difference]: With dead ends: 1053 [2019-11-28 18:23:42,552 INFO L226 Difference]: Without dead ends: 1053 [2019-11-28 18:23:42,552 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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:23:42,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2019-11-28 18:23:42,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 869. [2019-11-28 18:23:42,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869 states. [2019-11-28 18:23:42,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1917 transitions. [2019-11-28 18:23:42,572 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1917 transitions. Word has length 52 [2019-11-28 18:23:42,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:23:42,573 INFO L462 AbstractCegarLoop]: Abstraction has 869 states and 1917 transitions. [2019-11-28 18:23:42,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:23:42,573 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1917 transitions. [2019-11-28 18:23:42,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 18:23:42,577 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:23:42,577 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:23:42,577 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:23:42,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:23:42,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1774994823, now seen corresponding path program 1 times [2019-11-28 18:23:42,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:23:42,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973556442] [2019-11-28 18:23:42,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:23:42,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:23:42,732 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:23:42,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973556442] [2019-11-28 18:23:42,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:23:42,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:23:42,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496668166] [2019-11-28 18:23:42,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:23:42,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:23:42,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:23:42,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:23:42,736 INFO L87 Difference]: Start difference. First operand 869 states and 1917 transitions. Second operand 7 states. [2019-11-28 18:23:43,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:23:43,056 INFO L93 Difference]: Finished difference Result 2889 states and 6163 transitions. [2019-11-28 18:23:43,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 18:23:43,057 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-11-28 18:23:43,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:23:43,062 INFO L225 Difference]: With dead ends: 2889 [2019-11-28 18:23:43,063 INFO L226 Difference]: Without dead ends: 1961 [2019-11-28 18:23:43,063 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-11-28 18:23:43,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2019-11-28 18:23:43,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 1000. [2019-11-28 18:23:43,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1000 states. [2019-11-28 18:23:43,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 2189 transitions. [2019-11-28 18:23:43,094 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 2189 transitions. Word has length 53 [2019-11-28 18:23:43,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:23:43,094 INFO L462 AbstractCegarLoop]: Abstraction has 1000 states and 2189 transitions. [2019-11-28 18:23:43,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:23:43,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 2189 transitions. [2019-11-28 18:23:43,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 18:23:43,098 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:23:43,099 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:23:43,099 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:23:43,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:23:43,100 INFO L82 PathProgramCache]: Analyzing trace with hash 238171223, now seen corresponding path program 2 times [2019-11-28 18:23:43,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:23:43,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023007285] [2019-11-28 18:23:43,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:23:43,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:23:43,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:23:43,279 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:23:43,279 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:23:43,284 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_47| 0 0))) (and (= v_~main$tmp_guard0~0_31 0) (= v_~x$r_buff1_thd1~0_165 0) (= 0 v_~x~0_148) (= v_~x$r_buff0_thd0~0_133 0) (= v_~x$r_buff0_thd1~0_227 0) (= v_~weak$$choice2~0_120 0) (= |v_#NULL.offset_6| 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1711~0.base_24|) 0) (= v_~__unbuffered_p1_EBX~0_40 0) (= 0 v_~x$read_delayed_var~0.base_7) (= |v_#valid_45| (store .cse0 |v_ULTIMATE.start_main_~#t1711~0.base_24| 1)) (= 0 v_~__unbuffered_cnt~0_63) (= v_~main$tmp_guard1~0_41 0) (= v_~y~0_147 0) (= 0 |v_#NULL.base_6|) (= v_~x$flush_delayed~0_31 0) (= 0 v_~x$read_delayed~0_7) (= v_~x$mem_tmp~0_24 0) (= 0 v_~x$w_buff1_used~0_507) (= 0 v_~weak$$choice0~0_22) (= v_~x$r_buff1_thd0~0_183 0) (= 0 |v_ULTIMATE.start_main_~#t1711~0.offset_18|) (= 0 v_~x$w_buff1~0_317) (= 0 v_~x$w_buff0~0_542) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1711~0.base_24|) (= 0 v_~x$r_buff0_thd2~0_359) (= 0 v_~x$read_delayed_var~0.offset_7) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1711~0.base_24| 4)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1711~0.base_24| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1711~0.base_24|) |v_ULTIMATE.start_main_~#t1711~0.offset_18| 0)) |v_#memory_int_13|) (= 0 v_~x$w_buff0_used~0_792) (= 0 v_~__unbuffered_p1_EAX~0_39) (= 0 v_~x$r_buff1_thd2~0_331) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_542, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_227, ~x$flush_delayed~0=v_~x$flush_delayed~0_31, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_165, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_41, ~x$mem_tmp~0=v_~x$mem_tmp~0_24, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_28|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_34|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_69|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_34|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, #length=|v_#length_13|, ULTIMATE.start_main_~#t1711~0.base=|v_ULTIMATE.start_main_~#t1711~0.base_24|, ULTIMATE.start_main_~#t1711~0.offset=|v_ULTIMATE.start_main_~#t1711~0.offset_18|, ~y~0=v_~y~0_147, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_133, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_317, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_507, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_331, ULTIMATE.start_main_~#t1712~0.offset=|v_ULTIMATE.start_main_~#t1712~0.offset_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_183, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_359, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_792, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_37|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ULTIMATE.start_main_~#t1712~0.base=|v_ULTIMATE.start_main_~#t1712~0.base_16|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_19|, ~weak$$choice2~0=v_~weak$$choice2~0_120, ~x~0=v_~x~0_148, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p1_EAX~0, #length, ULTIMATE.start_main_~#t1711~0.base, ULTIMATE.start_main_~#t1711~0.offset, ~y~0, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t1712~0.offset, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t1712~0.base, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-11-28 18:23:43,285 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L4-->L738: Formula: (and (= 1 v_~x$r_buff0_thd1~0_40) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_72 0)) (= v_~x$r_buff1_thd1~0_23 v_~x$r_buff0_thd1~0_41) (= v_~x$r_buff1_thd2~0_64 v_~x$r_buff0_thd2~0_110) (= v_~y~0_18 1) (= v_~x$r_buff1_thd0~0_37 v_~x$r_buff0_thd0~0_53)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_72, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_72, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_64, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_23, ~y~0=v_~y~0_18, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_37} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:23:43,286 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L797-1-->L799: Formula: (and (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1712~0.base_12| 1) |v_#valid_27|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1712~0.base_12|)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1712~0.base_12| 4) |v_#length_9|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1712~0.base_12|) (not (= |v_ULTIMATE.start_main_~#t1712~0.base_12| 0)) (= 0 |v_ULTIMATE.start_main_~#t1712~0.offset_10|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1712~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1712~0.base_12|) |v_ULTIMATE.start_main_~#t1712~0.offset_10| 1)) |v_#memory_int_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1712~0.base=|v_ULTIMATE.start_main_~#t1712~0.base_12|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1712~0.offset=|v_ULTIMATE.start_main_~#t1712~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1712~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1712~0.offset] because there is no mapped edge [2019-11-28 18:23:43,289 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L739-->L739-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1871560799 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1871560799 256)))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out1871560799| 0)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1871560799 |P0Thread1of1ForFork0_#t~ite5_Out1871560799|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1871560799, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1871560799} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1871560799|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1871560799, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1871560799} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:23:43,291 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L763-->L763-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In838774193 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite15_Out838774193| ~x$w_buff0~0_In838774193) (= |P1Thread1of1ForFork1_#t~ite14_In838774193| |P1Thread1of1ForFork1_#t~ite14_Out838774193|)) (and (= ~x$w_buff0~0_In838774193 |P1Thread1of1ForFork1_#t~ite14_Out838774193|) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In838774193 256)))) (or (and (= (mod ~x$w_buff1_used~0_In838774193 256) 0) .cse1) (= (mod ~x$w_buff0_used~0_In838774193 256) 0) (and (= 0 (mod ~x$r_buff1_thd2~0_In838774193 256)) .cse1))) (= |P1Thread1of1ForFork1_#t~ite15_Out838774193| |P1Thread1of1ForFork1_#t~ite14_Out838774193|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In838774193, ~x$w_buff1_used~0=~x$w_buff1_used~0_In838774193, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In838774193, ~weak$$choice2~0=~weak$$choice2~0_In838774193, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In838774193, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In838774193|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In838774193} OutVars{~x$w_buff0~0=~x$w_buff0~0_In838774193, ~x$w_buff1_used~0=~x$w_buff1_used~0_In838774193, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In838774193, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out838774193|, ~weak$$choice2~0=~weak$$choice2~0_In838774193, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In838774193, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out838774193|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In838774193} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-11-28 18:23:43,292 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L740-->L740-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd1~0_In-1083972198 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1083972198 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In-1083972198 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1083972198 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out-1083972198| ~x$w_buff1_used~0_In-1083972198) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out-1083972198| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1083972198, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1083972198, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1083972198, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1083972198} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1083972198|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1083972198, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1083972198, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1083972198, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1083972198} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:23:43,293 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-2041515461 256))) (.cse2 (= ~x$r_buff0_thd1~0_In-2041515461 ~x$r_buff0_thd1~0_Out-2041515461)) (.cse1 (= (mod ~x$r_buff0_thd1~0_In-2041515461 256) 0))) (or (and (= ~x$r_buff0_thd1~0_Out-2041515461 0) (not .cse0) (not .cse1)) (and .cse2 .cse0) (and .cse2 .cse1))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2041515461, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2041515461} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out-2041515461, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-2041515461|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2041515461} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-11-28 18:23:43,293 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L742-->L742-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In1429371038 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd1~0_In1429371038 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1429371038 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In1429371038 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out1429371038| ~x$r_buff1_thd1~0_In1429371038) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1429371038|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1429371038, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1429371038, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1429371038, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1429371038} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1429371038, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1429371038|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1429371038, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1429371038, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1429371038} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:23:43,294 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L742-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~x$r_buff1_thd1~0_128 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_128} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-11-28 18:23:43,294 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L764-->L764-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1135358177 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite18_Out-1135358177| ~x$w_buff1~0_In-1135358177) (= |P1Thread1of1ForFork1_#t~ite17_In-1135358177| |P1Thread1of1ForFork1_#t~ite17_Out-1135358177|) (not .cse0)) (and (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-1135358177 256) 0))) (or (and (= 0 (mod ~x$w_buff1_used~0_In-1135358177 256)) .cse1) (= (mod ~x$w_buff0_used~0_In-1135358177 256) 0) (and .cse1 (= (mod ~x$r_buff1_thd2~0_In-1135358177 256) 0)))) (= |P1Thread1of1ForFork1_#t~ite17_Out-1135358177| |P1Thread1of1ForFork1_#t~ite18_Out-1135358177|) (= |P1Thread1of1ForFork1_#t~ite17_Out-1135358177| ~x$w_buff1~0_In-1135358177) .cse0))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1135358177, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1135358177, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1135358177, ~weak$$choice2~0=~weak$$choice2~0_In-1135358177, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1135358177, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In-1135358177|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1135358177} OutVars{P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out-1135358177|, ~x$w_buff1~0=~x$w_buff1~0_In-1135358177, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1135358177, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1135358177, ~weak$$choice2~0=~weak$$choice2~0_In-1135358177, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1135358177, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out-1135358177|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1135358177} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-11-28 18:23:43,295 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L765-->L765-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1514747573 256)))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite21_Out-1514747573| |P1Thread1of1ForFork1_#t~ite20_Out-1514747573|) (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-1514747573 256) 0))) (or (and (= (mod ~x$r_buff1_thd2~0_In-1514747573 256) 0) .cse1) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-1514747573 256))) (= 0 (mod ~x$w_buff0_used~0_In-1514747573 256)))) (= ~x$w_buff0_used~0_In-1514747573 |P1Thread1of1ForFork1_#t~ite20_Out-1514747573|)) (and (not .cse0) (= ~x$w_buff0_used~0_In-1514747573 |P1Thread1of1ForFork1_#t~ite21_Out-1514747573|) (= |P1Thread1of1ForFork1_#t~ite20_In-1514747573| |P1Thread1of1ForFork1_#t~ite20_Out-1514747573|)))) InVars {P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-1514747573|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1514747573, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1514747573, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1514747573, ~weak$$choice2~0=~weak$$choice2~0_In-1514747573, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1514747573} OutVars{P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-1514747573|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1514747573, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1514747573, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-1514747573|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1514747573, ~weak$$choice2~0=~weak$$choice2~0_In-1514747573, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1514747573} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-11-28 18:23:43,296 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L767-->L768: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~x$r_buff0_thd2~0_135 v_~x$r_buff0_thd2~0_134)) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_135, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_27, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_12|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-11-28 18:23:43,297 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L768-->L768-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-2129088552 256)))) (or (and (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-2129088552 256)))) (or (and .cse0 (= (mod ~x$r_buff1_thd2~0_In-2129088552 256) 0)) (and .cse0 (= 0 (mod ~x$w_buff1_used~0_In-2129088552 256))) (= (mod ~x$w_buff0_used~0_In-2129088552 256) 0))) (= |P1Thread1of1ForFork1_#t~ite29_Out-2129088552| |P1Thread1of1ForFork1_#t~ite30_Out-2129088552|) .cse1 (= |P1Thread1of1ForFork1_#t~ite29_Out-2129088552| ~x$r_buff1_thd2~0_In-2129088552)) (and (= |P1Thread1of1ForFork1_#t~ite29_In-2129088552| |P1Thread1of1ForFork1_#t~ite29_Out-2129088552|) (not .cse1) (= ~x$r_buff1_thd2~0_In-2129088552 |P1Thread1of1ForFork1_#t~ite30_Out-2129088552|)))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-2129088552|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2129088552, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2129088552, ~weak$$choice2~0=~weak$$choice2~0_In-2129088552, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2129088552, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2129088552} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-2129088552|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-2129088552|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2129088552, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2129088552, ~weak$$choice2~0=~weak$$choice2~0_In-2129088552, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2129088552, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2129088552} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-11-28 18:23:43,297 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L770-->L774: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_5 v_~x~0_14)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_7, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[~x$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31, ~x~0] because there is no mapped edge [2019-11-28 18:23:43,298 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L774-2-->L774-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-127026496 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-127026496 256) 0))) (or (and (not .cse0) (= ~x$w_buff1~0_In-127026496 |P1Thread1of1ForFork1_#t~ite32_Out-127026496|) (not .cse1)) (and (or .cse1 .cse0) (= ~x~0_In-127026496 |P1Thread1of1ForFork1_#t~ite32_Out-127026496|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-127026496, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-127026496, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-127026496, ~x~0=~x~0_In-127026496} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-127026496, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-127026496, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-127026496, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-127026496|, ~x~0=~x~0_In-127026496} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-11-28 18:23:43,298 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L774-4-->L775: Formula: (= v_~x~0_29 |v_P1Thread1of1ForFork1_#t~ite32_6|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_6|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_5|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_5|, ~x~0=v_~x~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-11-28 18:23:43,299 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L775-->L775-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-2090077044 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-2090077044 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-2090077044|) (not .cse0) (not .cse1)) (and (= ~x$w_buff0_used~0_In-2090077044 |P1Thread1of1ForFork1_#t~ite34_Out-2090077044|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2090077044, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2090077044} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-2090077044|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2090077044, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2090077044} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:23:43,299 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In-534755967 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-534755967 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-534755967 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-534755967 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-534755967|)) (and (= ~x$w_buff1_used~0_In-534755967 |P1Thread1of1ForFork1_#t~ite35_Out-534755967|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-534755967, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-534755967, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-534755967, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-534755967} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-534755967, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-534755967, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-534755967|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-534755967, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-534755967} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:23:43,301 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L777-->L777-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-1583495364 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1583495364 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out-1583495364| ~x$r_buff0_thd2~0_In-1583495364)) (and (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-1583495364|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1583495364, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1583495364} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1583495364, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1583495364|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1583495364} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:23:43,301 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In118899056 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In118899056 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In118899056 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In118899056 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd2~0_In118899056 |P1Thread1of1ForFork1_#t~ite37_Out118899056|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork1_#t~ite37_Out118899056| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In118899056, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In118899056, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In118899056, ~x$w_buff0_used~0=~x$w_buff0_used~0_In118899056} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In118899056, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In118899056, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In118899056, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out118899056|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In118899056} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:23:43,302 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L778-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_269 |v_P1Thread1of1ForFork1_#t~ite37_40|) (= (+ v_~__unbuffered_cnt~0_47 1) v_~__unbuffered_cnt~0_46) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_40|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_269, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_39|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:23:43,302 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= 0 (mod v_~x$r_buff0_thd0~0_64 256)) (= (mod v_~x$w_buff0_used~0_301 256) 0)) (not (= (mod v_~main$tmp_guard0~0_8 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_301} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_301} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 18:23:43,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In1649179520 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In1649179520 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out1649179520| ~x$w_buff1~0_In1649179520)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out1649179520| ~x~0_In1649179520)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1649179520, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1649179520, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1649179520, ~x~0=~x~0_In1649179520} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1649179520|, ~x$w_buff1~0=~x$w_buff1~0_In1649179520, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1649179520, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1649179520, ~x~0=~x~0_In1649179520} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:23:43,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L805-4-->L806: Formula: (= v_~x~0_46 |v_ULTIMATE.start_main_#t~ite40_13|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~x~0=v_~x~0_46} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x~0] because there is no mapped edge [2019-11-28 18:23:43,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L806-->L806-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-524327450 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-524327450 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite42_Out-524327450|) (not .cse1)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-524327450 |ULTIMATE.start_main_#t~ite42_Out-524327450|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-524327450, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-524327450} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-524327450, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-524327450|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-524327450} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:23:43,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L807-->L807-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-966841234 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-966841234 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-966841234 256))) (.cse3 (= (mod ~x$r_buff1_thd0~0_In-966841234 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-966841234| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite43_Out-966841234| ~x$w_buff1_used~0_In-966841234) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-966841234, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-966841234, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-966841234, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-966841234} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-966841234, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-966841234, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-966841234|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-966841234, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-966841234} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:23:43,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L808-->L808-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-1623947560 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1623947560 256)))) (or (and (= ~x$r_buff0_thd0~0_In-1623947560 |ULTIMATE.start_main_#t~ite44_Out-1623947560|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite44_Out-1623947560|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1623947560, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1623947560} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1623947560, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1623947560|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1623947560} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:23:43,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L809-->L809-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In904429865 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In904429865 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In904429865 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In904429865 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out904429865| 0)) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite45_Out904429865| ~x$r_buff1_thd0~0_In904429865) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In904429865, ~x$w_buff1_used~0=~x$w_buff1_used~0_In904429865, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In904429865, ~x$w_buff0_used~0=~x$w_buff0_used~0_In904429865} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In904429865, ~x$w_buff1_used~0=~x$w_buff1_used~0_In904429865, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In904429865, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out904429865|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In904429865} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:23:43,305 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_27 0) (= v_~y~0_126 2) (= 2 v_~__unbuffered_p1_EAX~0_27))) 1 0)) 0 1) v_~main$tmp_guard1~0_20) (= v_~x$r_buff1_thd0~0_149 |v_ULTIMATE.start_main_#t~ite45_40|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= (mod v_~main$tmp_guard1~0_20 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~y~0=v_~y~0_126, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_40|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~y~0=v_~y~0_126, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_149, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:23:43,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:23:43 BasicIcfg [2019-11-28 18:23:43,407 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:23:43,408 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:23:43,408 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:23:43,408 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:23:43,409 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:23:28" (3/4) ... [2019-11-28 18:23:43,415 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:23:43,416 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_47| 0 0))) (and (= v_~main$tmp_guard0~0_31 0) (= v_~x$r_buff1_thd1~0_165 0) (= 0 v_~x~0_148) (= v_~x$r_buff0_thd0~0_133 0) (= v_~x$r_buff0_thd1~0_227 0) (= v_~weak$$choice2~0_120 0) (= |v_#NULL.offset_6| 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1711~0.base_24|) 0) (= v_~__unbuffered_p1_EBX~0_40 0) (= 0 v_~x$read_delayed_var~0.base_7) (= |v_#valid_45| (store .cse0 |v_ULTIMATE.start_main_~#t1711~0.base_24| 1)) (= 0 v_~__unbuffered_cnt~0_63) (= v_~main$tmp_guard1~0_41 0) (= v_~y~0_147 0) (= 0 |v_#NULL.base_6|) (= v_~x$flush_delayed~0_31 0) (= 0 v_~x$read_delayed~0_7) (= v_~x$mem_tmp~0_24 0) (= 0 v_~x$w_buff1_used~0_507) (= 0 v_~weak$$choice0~0_22) (= v_~x$r_buff1_thd0~0_183 0) (= 0 |v_ULTIMATE.start_main_~#t1711~0.offset_18|) (= 0 v_~x$w_buff1~0_317) (= 0 v_~x$w_buff0~0_542) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1711~0.base_24|) (= 0 v_~x$r_buff0_thd2~0_359) (= 0 v_~x$read_delayed_var~0.offset_7) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1711~0.base_24| 4)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1711~0.base_24| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1711~0.base_24|) |v_ULTIMATE.start_main_~#t1711~0.offset_18| 0)) |v_#memory_int_13|) (= 0 v_~x$w_buff0_used~0_792) (= 0 v_~__unbuffered_p1_EAX~0_39) (= 0 v_~x$r_buff1_thd2~0_331) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_542, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_227, ~x$flush_delayed~0=v_~x$flush_delayed~0_31, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_165, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_41, ~x$mem_tmp~0=v_~x$mem_tmp~0_24, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_28|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_34|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_69|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_34|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, #length=|v_#length_13|, ULTIMATE.start_main_~#t1711~0.base=|v_ULTIMATE.start_main_~#t1711~0.base_24|, ULTIMATE.start_main_~#t1711~0.offset=|v_ULTIMATE.start_main_~#t1711~0.offset_18|, ~y~0=v_~y~0_147, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_133, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_317, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_507, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_331, ULTIMATE.start_main_~#t1712~0.offset=|v_ULTIMATE.start_main_~#t1712~0.offset_14|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_183, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_359, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_792, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_37|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ULTIMATE.start_main_~#t1712~0.base=|v_ULTIMATE.start_main_~#t1712~0.base_16|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_19|, ~weak$$choice2~0=v_~weak$$choice2~0_120, ~x~0=v_~x~0_148, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p1_EAX~0, #length, ULTIMATE.start_main_~#t1711~0.base, ULTIMATE.start_main_~#t1711~0.offset, ~y~0, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_~#t1712~0.offset, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t1712~0.base, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-11-28 18:23:43,417 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L4-->L738: Formula: (and (= 1 v_~x$r_buff0_thd1~0_40) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_72 0)) (= v_~x$r_buff1_thd1~0_23 v_~x$r_buff0_thd1~0_41) (= v_~x$r_buff1_thd2~0_64 v_~x$r_buff0_thd2~0_110) (= v_~y~0_18 1) (= v_~x$r_buff1_thd0~0_37 v_~x$r_buff0_thd0~0_53)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_72, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_72, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_64, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_23, ~y~0=v_~y~0_18, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_37} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:23:43,417 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L797-1-->L799: Formula: (and (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1712~0.base_12| 1) |v_#valid_27|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1712~0.base_12|)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1712~0.base_12| 4) |v_#length_9|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1712~0.base_12|) (not (= |v_ULTIMATE.start_main_~#t1712~0.base_12| 0)) (= 0 |v_ULTIMATE.start_main_~#t1712~0.offset_10|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1712~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1712~0.base_12|) |v_ULTIMATE.start_main_~#t1712~0.offset_10| 1)) |v_#memory_int_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1712~0.base=|v_ULTIMATE.start_main_~#t1712~0.base_12|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1712~0.offset=|v_ULTIMATE.start_main_~#t1712~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1712~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1712~0.offset] because there is no mapped edge [2019-11-28 18:23:43,419 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L739-->L739-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1871560799 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1871560799 256)))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out1871560799| 0)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1871560799 |P0Thread1of1ForFork0_#t~ite5_Out1871560799|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1871560799, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1871560799} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1871560799|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1871560799, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1871560799} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:23:43,420 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L763-->L763-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In838774193 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite15_Out838774193| ~x$w_buff0~0_In838774193) (= |P1Thread1of1ForFork1_#t~ite14_In838774193| |P1Thread1of1ForFork1_#t~ite14_Out838774193|)) (and (= ~x$w_buff0~0_In838774193 |P1Thread1of1ForFork1_#t~ite14_Out838774193|) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In838774193 256)))) (or (and (= (mod ~x$w_buff1_used~0_In838774193 256) 0) .cse1) (= (mod ~x$w_buff0_used~0_In838774193 256) 0) (and (= 0 (mod ~x$r_buff1_thd2~0_In838774193 256)) .cse1))) (= |P1Thread1of1ForFork1_#t~ite15_Out838774193| |P1Thread1of1ForFork1_#t~ite14_Out838774193|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In838774193, ~x$w_buff1_used~0=~x$w_buff1_used~0_In838774193, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In838774193, ~weak$$choice2~0=~weak$$choice2~0_In838774193, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In838774193, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In838774193|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In838774193} OutVars{~x$w_buff0~0=~x$w_buff0~0_In838774193, ~x$w_buff1_used~0=~x$w_buff1_used~0_In838774193, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In838774193, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out838774193|, ~weak$$choice2~0=~weak$$choice2~0_In838774193, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In838774193, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out838774193|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In838774193} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-11-28 18:23:43,421 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L740-->L740-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd1~0_In-1083972198 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1083972198 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In-1083972198 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1083972198 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out-1083972198| ~x$w_buff1_used~0_In-1083972198) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out-1083972198| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1083972198, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1083972198, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1083972198, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1083972198} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1083972198|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1083972198, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1083972198, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1083972198, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1083972198} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:23:43,421 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-2041515461 256))) (.cse2 (= ~x$r_buff0_thd1~0_In-2041515461 ~x$r_buff0_thd1~0_Out-2041515461)) (.cse1 (= (mod ~x$r_buff0_thd1~0_In-2041515461 256) 0))) (or (and (= ~x$r_buff0_thd1~0_Out-2041515461 0) (not .cse0) (not .cse1)) (and .cse2 .cse0) (and .cse2 .cse1))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2041515461, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2041515461} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out-2041515461, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-2041515461|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2041515461} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-11-28 18:23:43,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L742-->L742-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In1429371038 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd1~0_In1429371038 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1429371038 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd1~0_In1429371038 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out1429371038| ~x$r_buff1_thd1~0_In1429371038) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1429371038|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1429371038, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1429371038, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1429371038, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1429371038} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1429371038, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1429371038|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1429371038, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1429371038, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1429371038} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:23:43,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L742-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~x$r_buff1_thd1~0_128 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_128} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-11-28 18:23:43,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L764-->L764-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1135358177 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite18_Out-1135358177| ~x$w_buff1~0_In-1135358177) (= |P1Thread1of1ForFork1_#t~ite17_In-1135358177| |P1Thread1of1ForFork1_#t~ite17_Out-1135358177|) (not .cse0)) (and (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-1135358177 256) 0))) (or (and (= 0 (mod ~x$w_buff1_used~0_In-1135358177 256)) .cse1) (= (mod ~x$w_buff0_used~0_In-1135358177 256) 0) (and .cse1 (= (mod ~x$r_buff1_thd2~0_In-1135358177 256) 0)))) (= |P1Thread1of1ForFork1_#t~ite17_Out-1135358177| |P1Thread1of1ForFork1_#t~ite18_Out-1135358177|) (= |P1Thread1of1ForFork1_#t~ite17_Out-1135358177| ~x$w_buff1~0_In-1135358177) .cse0))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1135358177, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1135358177, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1135358177, ~weak$$choice2~0=~weak$$choice2~0_In-1135358177, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1135358177, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In-1135358177|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1135358177} OutVars{P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out-1135358177|, ~x$w_buff1~0=~x$w_buff1~0_In-1135358177, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1135358177, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1135358177, ~weak$$choice2~0=~weak$$choice2~0_In-1135358177, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1135358177, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out-1135358177|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1135358177} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-11-28 18:23:43,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L765-->L765-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1514747573 256)))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite21_Out-1514747573| |P1Thread1of1ForFork1_#t~ite20_Out-1514747573|) (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-1514747573 256) 0))) (or (and (= (mod ~x$r_buff1_thd2~0_In-1514747573 256) 0) .cse1) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-1514747573 256))) (= 0 (mod ~x$w_buff0_used~0_In-1514747573 256)))) (= ~x$w_buff0_used~0_In-1514747573 |P1Thread1of1ForFork1_#t~ite20_Out-1514747573|)) (and (not .cse0) (= ~x$w_buff0_used~0_In-1514747573 |P1Thread1of1ForFork1_#t~ite21_Out-1514747573|) (= |P1Thread1of1ForFork1_#t~ite20_In-1514747573| |P1Thread1of1ForFork1_#t~ite20_Out-1514747573|)))) InVars {P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-1514747573|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1514747573, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1514747573, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1514747573, ~weak$$choice2~0=~weak$$choice2~0_In-1514747573, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1514747573} OutVars{P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-1514747573|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1514747573, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1514747573, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-1514747573|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1514747573, ~weak$$choice2~0=~weak$$choice2~0_In-1514747573, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1514747573} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-11-28 18:23:43,424 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L767-->L768: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~x$r_buff0_thd2~0_135 v_~x$r_buff0_thd2~0_134)) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_135, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_27, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_12|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-11-28 18:23:43,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L768-->L768-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-2129088552 256)))) (or (and (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-2129088552 256)))) (or (and .cse0 (= (mod ~x$r_buff1_thd2~0_In-2129088552 256) 0)) (and .cse0 (= 0 (mod ~x$w_buff1_used~0_In-2129088552 256))) (= (mod ~x$w_buff0_used~0_In-2129088552 256) 0))) (= |P1Thread1of1ForFork1_#t~ite29_Out-2129088552| |P1Thread1of1ForFork1_#t~ite30_Out-2129088552|) .cse1 (= |P1Thread1of1ForFork1_#t~ite29_Out-2129088552| ~x$r_buff1_thd2~0_In-2129088552)) (and (= |P1Thread1of1ForFork1_#t~ite29_In-2129088552| |P1Thread1of1ForFork1_#t~ite29_Out-2129088552|) (not .cse1) (= ~x$r_buff1_thd2~0_In-2129088552 |P1Thread1of1ForFork1_#t~ite30_Out-2129088552|)))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-2129088552|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2129088552, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2129088552, ~weak$$choice2~0=~weak$$choice2~0_In-2129088552, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2129088552, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2129088552} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-2129088552|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-2129088552|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2129088552, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2129088552, ~weak$$choice2~0=~weak$$choice2~0_In-2129088552, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2129088552, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2129088552} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-11-28 18:23:43,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L770-->L774: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_5 v_~x~0_14)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_7, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[~x$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31, ~x~0] because there is no mapped edge [2019-11-28 18:23:43,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L774-2-->L774-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-127026496 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-127026496 256) 0))) (or (and (not .cse0) (= ~x$w_buff1~0_In-127026496 |P1Thread1of1ForFork1_#t~ite32_Out-127026496|) (not .cse1)) (and (or .cse1 .cse0) (= ~x~0_In-127026496 |P1Thread1of1ForFork1_#t~ite32_Out-127026496|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-127026496, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-127026496, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-127026496, ~x~0=~x~0_In-127026496} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-127026496, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-127026496, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-127026496, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-127026496|, ~x~0=~x~0_In-127026496} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-11-28 18:23:43,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L774-4-->L775: Formula: (= v_~x~0_29 |v_P1Thread1of1ForFork1_#t~ite32_6|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_6|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_5|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_5|, ~x~0=v_~x~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-11-28 18:23:43,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L775-->L775-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-2090077044 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-2090077044 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-2090077044|) (not .cse0) (not .cse1)) (and (= ~x$w_buff0_used~0_In-2090077044 |P1Thread1of1ForFork1_#t~ite34_Out-2090077044|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2090077044, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2090077044} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-2090077044|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2090077044, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2090077044} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:23:43,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In-534755967 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-534755967 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-534755967 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-534755967 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-534755967|)) (and (= ~x$w_buff1_used~0_In-534755967 |P1Thread1of1ForFork1_#t~ite35_Out-534755967|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-534755967, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-534755967, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-534755967, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-534755967} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-534755967, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-534755967, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-534755967|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-534755967, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-534755967} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:23:43,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L777-->L777-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In-1583495364 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1583495364 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out-1583495364| ~x$r_buff0_thd2~0_In-1583495364)) (and (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-1583495364|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1583495364, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1583495364} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1583495364, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1583495364|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1583495364} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:23:43,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In118899056 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In118899056 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In118899056 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In118899056 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd2~0_In118899056 |P1Thread1of1ForFork1_#t~ite37_Out118899056|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork1_#t~ite37_Out118899056| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In118899056, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In118899056, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In118899056, ~x$w_buff0_used~0=~x$w_buff0_used~0_In118899056} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In118899056, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In118899056, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In118899056, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out118899056|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In118899056} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:23:43,428 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L778-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_269 |v_P1Thread1of1ForFork1_#t~ite37_40|) (= (+ v_~__unbuffered_cnt~0_47 1) v_~__unbuffered_cnt~0_46) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_40|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_269, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_39|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:23:43,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= 0 (mod v_~x$r_buff0_thd0~0_64 256)) (= (mod v_~x$w_buff0_used~0_301 256) 0)) (not (= (mod v_~main$tmp_guard0~0_8 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_301} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_301} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 18:23:43,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In1649179520 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In1649179520 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out1649179520| ~x$w_buff1~0_In1649179520)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out1649179520| ~x~0_In1649179520)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1649179520, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1649179520, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1649179520, ~x~0=~x~0_In1649179520} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1649179520|, ~x$w_buff1~0=~x$w_buff1~0_In1649179520, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1649179520, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1649179520, ~x~0=~x~0_In1649179520} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:23:43,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L805-4-->L806: Formula: (= v_~x~0_46 |v_ULTIMATE.start_main_#t~ite40_13|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~x~0=v_~x~0_46} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x~0] because there is no mapped edge [2019-11-28 18:23:43,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L806-->L806-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-524327450 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-524327450 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite42_Out-524327450|) (not .cse1)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-524327450 |ULTIMATE.start_main_#t~ite42_Out-524327450|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-524327450, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-524327450} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-524327450, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-524327450|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-524327450} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:23:43,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L807-->L807-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-966841234 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-966841234 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-966841234 256))) (.cse3 (= (mod ~x$r_buff1_thd0~0_In-966841234 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-966841234| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite43_Out-966841234| ~x$w_buff1_used~0_In-966841234) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-966841234, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-966841234, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-966841234, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-966841234} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-966841234, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-966841234, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-966841234|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-966841234, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-966841234} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:23:43,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L808-->L808-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-1623947560 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1623947560 256)))) (or (and (= ~x$r_buff0_thd0~0_In-1623947560 |ULTIMATE.start_main_#t~ite44_Out-1623947560|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite44_Out-1623947560|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1623947560, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1623947560} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1623947560, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1623947560|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1623947560} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:23:43,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L809-->L809-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In904429865 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In904429865 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In904429865 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In904429865 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out904429865| 0)) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite45_Out904429865| ~x$r_buff1_thd0~0_In904429865) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In904429865, ~x$w_buff1_used~0=~x$w_buff1_used~0_In904429865, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In904429865, ~x$w_buff0_used~0=~x$w_buff0_used~0_In904429865} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In904429865, ~x$w_buff1_used~0=~x$w_buff1_used~0_In904429865, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In904429865, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out904429865|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In904429865} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:23:43,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_27 0) (= v_~y~0_126 2) (= 2 v_~__unbuffered_p1_EAX~0_27))) 1 0)) 0 1) v_~main$tmp_guard1~0_20) (= v_~x$r_buff1_thd0~0_149 |v_ULTIMATE.start_main_#t~ite45_40|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= (mod v_~main$tmp_guard1~0_20 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~y~0=v_~y~0_126, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_40|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~y~0=v_~y~0_126, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_149, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:23:43,519 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:23:43,519 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:23:43,521 INFO L168 Benchmark]: Toolchain (without parser) took 16627.47 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 533.2 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -187.2 MB). Peak memory consumption was 346.0 MB. Max. memory is 11.5 GB. [2019-11-28 18:23:43,522 INFO L168 Benchmark]: CDTParser took 0.20 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:23:43,522 INFO L168 Benchmark]: CACSL2BoogieTranslator took 809.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -154.0 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-28 18:23:43,523 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.06 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 18:23:43,524 INFO L168 Benchmark]: Boogie Preprocessor took 37.63 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:23:43,524 INFO L168 Benchmark]: RCFGBuilder took 812.89 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: 45.5 MB). Peak memory consumption was 45.5 MB. Max. memory is 11.5 GB. [2019-11-28 18:23:43,525 INFO L168 Benchmark]: TraceAbstraction took 14787.53 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 381.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -97.9 MB). Peak memory consumption was 283.7 MB. Max. memory is 11.5 GB. [2019-11-28 18:23:43,526 INFO L168 Benchmark]: Witness Printer took 111.30 ms. Allocated memory is still 1.6 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 11.5 GB. [2019-11-28 18:23:43,529 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 809.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -154.0 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 62.06 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.63 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 812.89 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: 45.5 MB). Peak memory consumption was 45.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14787.53 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 381.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -97.9 MB). Peak memory consumption was 283.7 MB. Max. memory is 11.5 GB. * Witness Printer took 111.30 ms. Allocated memory is still 1.6 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.4s, 147 ProgramPointsBefore, 79 ProgramPointsAfterwards, 181 TransitionsBefore, 90 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 12 FixpointIterations, 29 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 26 ChoiceCompositions, 4894 VarBasedMoverChecksPositive, 354 VarBasedMoverChecksNegative, 269 SemBasedMoverChecksPositive, 191 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 76691 CheckedPairsTotal, 108 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t1711, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L724] 1 x$w_buff1 = x$w_buff0 [L725] 1 x$w_buff0 = 1 [L726] 1 x$w_buff1_used = x$w_buff0_used [L727] 1 x$w_buff0_used = (_Bool)1 [L738] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] FCALL, FORK 0 pthread_create(&t1712, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L752] 2 y = 2 [L755] 2 __unbuffered_p1_EAX = y [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 x$flush_delayed = weak$$choice2 [L761] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L762] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L762] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L763] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L739] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L740] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L764] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L765] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L766] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L768] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L774] 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=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L776] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L777] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L806] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L807] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L808] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 14.4s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1525 SDtfs, 1958 SDslu, 2895 SDs, 0 SdLazy, 1235 SolverSat, 120 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 13 SyntacticMatches, 7 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16697occurred 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.7s AutomataMinimizationTime, 12 MinimizatonAttempts, 10973 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 341 NumberOfCodeBlocks, 341 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 276 ConstructedInterpolants, 0 QuantifiedInterpolants, 34450 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...